./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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.8_overflow.ufo.UNBOUNDED.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 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:52,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:52,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:52,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:52,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:52,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:52,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:52,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:52,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:52,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:52,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:52,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:52,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:53,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:53,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:53,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:53,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:53,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:53,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:53,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:53,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:53,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:53,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:53,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:53,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:53,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:53,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:53,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:53,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:53,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:53,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:53,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:53,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:53,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:53,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:53,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:53,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:53,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:53,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:53,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:53,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:53,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:30:53,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:53,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:53,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:53,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:53,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:53,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:53,048 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:53,048 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:53,048 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:53,048 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:53,049 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:53,049 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:53,049 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:53,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:53,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:53,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:53,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:53,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:53,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:53,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:53,053 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:53,053 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 -> 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 [2022-02-21 04:30:53,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:53,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:53,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:53,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:53,284 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:53,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:53,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c57d217d/44c0783bb649405ab8a010cfba585ada/FLAGfe1633aa9 [2022-02-21 04:30:53,783 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:53,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:53,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c57d217d/44c0783bb649405ab8a010cfba585ada/FLAGfe1633aa9 [2022-02-21 04:30:53,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c57d217d/44c0783bb649405ab8a010cfba585ada [2022-02-21 04:30:53,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:53,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:53,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:53,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:53,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:53,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:53" (1/1) ... [2022-02-21 04:30:53,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d623c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:53, skipping insertion in model container [2022-02-21 04:30:53,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:53" (1/1) ... [2022-02-21 04:30:53,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:53,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:54,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2022-02-21 04:30:54,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:54,265 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:54,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2022-02-21 04:30:54,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:54,382 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:54,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54 WrapperNode [2022-02-21 04:30:54,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:54,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:54,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:54,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:54,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,461 INFO L137 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 494 [2022-02-21 04:30:54,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:54,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:54,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:54,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:54,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:54,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:54,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:54,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:54,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (1/1) ... [2022-02-21 04:30:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:54,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:54,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:30:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:54,796 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:54,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:55,322 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:55,334 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:55,334 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:55,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:55 BoogieIcfgContainer [2022-02-21 04:30:55,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:55,338 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:55,338 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:55,341 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:55,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:53" (1/3) ... [2022-02-21 04:30:55,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a075314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:55, skipping insertion in model container [2022-02-21 04:30:55,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:54" (2/3) ... [2022-02-21 04:30:55,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a075314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:55, skipping insertion in model container [2022-02-21 04:30:55,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:55,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:55" (3/3) ... [2022-02-21 04:30:55,345 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-21 04:30:55,386 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:55,386 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:55,386 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:55,387 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:55,387 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:55,387 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:55,387 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:55,387 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:55,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:55,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:30:55,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:55,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:55,454 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,454 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, 1] [2022-02-21 04:30:55,454 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:55,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:55,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:30:55,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:55,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:55,490 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:55,490 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, 1] [2022-02-21 04:30:55,496 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 37#L297true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 36#L297-1true init_#res#1 := init_~tmp~0#1; 8#L542true main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 53#L24true assume !(0 == assume_abort_if_not_~cond#1); 13#L23true assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 132#L632-2true [2022-02-21 04:30:55,504 INFO L793 eck$LassoCheckResult]: Loop: 132#L632-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 133#L94true assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 114#L98true assume !(node1_~m1~0#1 != ~nomsg~0); 17#L98-1true ~mode1~0 := 0; 119#L94-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 51#L120true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 21#L123true assume !(node2_~m2~0#1 != ~nomsg~0); 38#L123-1true ~mode2~0 := 0; 31#L120-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 67#L145true assume !(0 != ~mode3~0 % 256); 15#L158true assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 12#L158-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 62#L145-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 80#L170true assume !(0 != ~mode4~0 % 256); 28#L183true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 44#L183-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 56#L170-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 120#L195true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 83#L198true assume !(node5_~m5~0#1 != ~nomsg~0); 105#L198-1true ~mode5~0 := 0; 86#L195-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 73#L220true assume !(0 != ~mode6~0 % 256); 74#L233true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 69#L233-2true ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 57#L220-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 27#L245true assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 145#L248true assume !(node7_~m7~0#1 != ~nomsg~0); 90#L248-1true ~mode7~0 := 0; 87#L245-2true assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 9#L270true assume !(0 != ~mode8~0 % 256); 111#L283true assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 14#L283-2true ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 75#L270-2true assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 146#L550true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 52#L550-1true check_#res#1 := check_~tmp~1#1; 45#L570true main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 54#L670true assume !(0 == assert_~arg#1 % 256); 104#L665true assume { :end_inline_assert } true; 132#L632-2true [2022-02-21 04:30:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2144605008, now seen corresponding path program 1 times [2022-02-21 04:30:55,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:55,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858540525] [2022-02-21 04:30:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:55,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {150#true} is VALID [2022-02-21 04:30:55,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {150#true} is VALID [2022-02-21 04:30:55,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:55,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {153#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:55,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:55,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {151#false} is VALID [2022-02-21 04:30:55,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#false} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {151#false} is VALID [2022-02-21 04:30:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:55,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:55,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858540525] [2022-02-21 04:30:55,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858540525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:55,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:55,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:55,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281519634] [2022-02-21 04:30:55,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:55,722 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1401409375, now seen corresponding path program 1 times [2022-02-21 04:30:55,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:55,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491182018] [2022-02-21 04:30:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:55,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} assume !(node1_~m1~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:55,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#true} ~mode1~0 := 0; {155#true} is VALID [2022-02-21 04:30:55,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {155#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#true} assume !(node2_~m2~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#true} ~mode2~0 := 0; {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#true} assume !(0 != ~mode3~0 % 256); {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {155#true} is VALID [2022-02-21 04:30:55,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#true} assume !(0 != ~mode4~0 % 256); {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {155#true} assume !(node5_~m5~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#true} ~mode5~0 := 0; {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {155#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {155#true} assume !(0 != ~mode6~0 % 256); {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {155#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {155#true} is VALID [2022-02-21 04:30:55,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {155#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {155#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {155#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {155#true} assume !(node7_~m7~0#1 != ~nomsg~0); {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {155#true} ~mode7~0 := 0; {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {155#true} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {155#true} is VALID [2022-02-21 04:30:55,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {155#true} assume !(0 != ~mode8~0 % 256); {155#true} is VALID [2022-02-21 04:30:55,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {155#true} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {155#true} is VALID [2022-02-21 04:30:55,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {155#true} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {155#true} is VALID [2022-02-21 04:30:55,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {155#true} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {155#true} is VALID [2022-02-21 04:30:55,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {155#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {157#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:55,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {158#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:55,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {158#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {159#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:55,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {156#false} is VALID [2022-02-21 04:30:55,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {156#false} assume { :end_inline_assert } true; {156#false} is VALID [2022-02-21 04:30:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:55,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:55,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491182018] [2022-02-21 04:30:55,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491182018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:55,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:55,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:55,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185919286] [2022-02-21 04:30:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:55,853 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:55,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:55,873 INFO L87 Difference]: Start difference. First operand has 146 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 145 states have internal predecessors, (255), 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) [2022-02-21 04:30:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,366 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-21 04:30:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:56,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 04:30:56,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:56,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 250 transitions. [2022-02-21 04:30:56,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:56,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 141 states and 186 transitions. [2022-02-21 04:30:56,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-02-21 04:30:56,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-02-21 04:30:56,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 186 transitions. [2022-02-21 04:30:56,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:56,408 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 186 transitions. [2022-02-21 04:30:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-21 04:30:56,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:56,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:56,459 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:56,460 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,473 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2022-02-21 04:30:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:56,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:56,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:56,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 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 141 states and 186 transitions. [2022-02-21 04:30:56,478 INFO L87 Difference]: Start difference. First operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 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 141 states and 186 transitions. [2022-02-21 04:30:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:56,488 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2022-02-21 04:30:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:56,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:56,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:56,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:56,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2022-02-21 04:30:56,503 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:56,503 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 186 transitions. [2022-02-21 04:30:56,503 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:56,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 186 transitions. [2022-02-21 04:30:56,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:56,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:56,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:56,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:56,515 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, 1] [2022-02-21 04:30:56,516 INFO L791 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 383#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 371#L297 assume 0 == ~r1~0 % 256; 360#L298 assume ~id1~0 >= 0; 361#L299 assume 0 == ~st1~0; 380#L300 assume ~send1~0 == ~id1~0; 421#L301 assume 0 == ~mode1~0 % 256; 433#L302 assume ~id2~0 >= 0; 434#L303 assume 0 == ~st2~0; 440#L304 assume ~send2~0 == ~id2~0; 412#L305 assume 0 == ~mode2~0 % 256; 413#L306 assume ~id3~0 >= 0; 429#L307 assume 0 == ~st3~0; 325#L308 assume ~send3~0 == ~id3~0; 326#L309 assume 0 == ~mode3~0 % 256; 425#L310 assume ~id4~0 >= 0; 395#L311 assume 0 == ~st4~0; 396#L312 assume ~send4~0 == ~id4~0; 346#L313 assume 0 == ~mode4~0 % 256; 347#L314 assume ~id5~0 >= 0; 386#L315 assume 0 == ~st5~0; 387#L316 assume ~send5~0 == ~id5~0; 313#L317 assume 0 == ~mode5~0 % 256; 314#L318 assume ~id6~0 >= 0; 449#L319 assume 0 == ~st6~0; 432#L320 assume ~send6~0 == ~id6~0; 418#L321 assume 0 == ~mode6~0 % 256; 419#L322 assume ~id7~0 >= 0; 309#L323 assume 0 == ~st7~0; 310#L324 assume ~send7~0 == ~id7~0; 334#L325 assume 0 == ~mode7~0 % 256; 354#L326 assume ~id8~0 >= 0; 337#L327 assume 0 == ~st8~0; 338#L328 assume ~send8~0 == ~id8~0; 373#L329 assume 0 == ~mode8~0 % 256; 374#L330 assume ~id1~0 != ~id2~0; 323#L331 assume ~id1~0 != ~id3~0; 324#L332 assume ~id1~0 != ~id4~0; 350#L333 assume ~id1~0 != ~id5~0; 372#L334 assume ~id1~0 != ~id6~0; 344#L335 assume ~id1~0 != ~id7~0; 345#L336 assume ~id1~0 != ~id8~0; 428#L337 assume ~id2~0 != ~id3~0; 400#L338 assume ~id2~0 != ~id4~0; 401#L339 assume ~id2~0 != ~id5~0; 443#L340 assume ~id2~0 != ~id6~0; 438#L341 assume ~id2~0 != ~id7~0; 375#L342 assume ~id2~0 != ~id8~0; 376#L343 assume ~id3~0 != ~id4~0; 362#L344 assume ~id3~0 != ~id5~0; 363#L345 assume ~id3~0 != ~id6~0; 388#L346 assume ~id3~0 != ~id7~0; 389#L347 assume ~id3~0 != ~id8~0; 446#L348 assume ~id4~0 != ~id5~0; 435#L349 assume ~id4~0 != ~id6~0; 436#L350 assume ~id4~0 != ~id7~0; 422#L351 assume ~id4~0 != ~id8~0; 423#L352 assume ~id5~0 != ~id6~0; 439#L353 assume ~id5~0 != ~id7~0; 408#L354 assume ~id5~0 != ~id8~0; 377#L355 assume ~id6~0 != ~id7~0; 378#L356 assume ~id6~0 != ~id8~0; 407#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 370#L297-1 init_#res#1 := init_~tmp~0#1; 318#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 319#L24 assume !(0 == assume_abort_if_not_~cond#1); 329#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 330#L632-2 [2022-02-21 04:30:56,517 INFO L793 eck$LassoCheckResult]: Loop: 330#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 447#L94 assume !(0 != ~mode1~0 % 256); 339#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 340#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 336#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 391#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 341#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 342#L123-1 ~mode2~0 := 0; 349#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 364#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 357#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 358#L148-1 ~mode3~0 := 0; 328#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 402#L170 assume !(0 != ~mode4~0 % 256); 355#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 356#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 379#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 394#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 424#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 398#L198-1 ~mode5~0 := 0; 427#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 414#L220 assume !(0 != ~mode6~0 % 256); 416#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 410#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 312#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 351#L245 assume !(0 != ~mode7~0 % 256); 352#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 369#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 426#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 320#L270 assume !(0 != ~mode8~0 % 256); 321#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 331#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 332#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 417#L550 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; 385#L550-1 check_#res#1 := check_~tmp~1#1; 381#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 382#L670 assume !(0 == assert_~arg#1 % 256); 393#L665 assume { :end_inline_assert } true; 330#L632-2 [2022-02-21 04:30:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 1 times [2022-02-21 04:30:56,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:56,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423279009] [2022-02-21 04:30:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:56,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:56,743 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 112147223, now seen corresponding path program 1 times [2022-02-21 04:30:56,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:56,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070120830] [2022-02-21 04:30:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:56,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {737#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {737#true} assume !(0 != ~mode1~0 % 256); {737#true} is VALID [2022-02-21 04:30:56,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {737#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {737#true} is VALID [2022-02-21 04:30:56,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {737#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {737#true} is VALID [2022-02-21 04:30:56,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {737#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {737#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {737#true} assume !(node2_~m2~0#1 != ~nomsg~0); {737#true} is VALID [2022-02-21 04:30:56,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {737#true} ~mode2~0 := 0; {737#true} is VALID [2022-02-21 04:30:56,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {737#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {737#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {737#true} assume !(node3_~m3~0#1 != ~nomsg~0); {737#true} is VALID [2022-02-21 04:30:56,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {737#true} ~mode3~0 := 0; {737#true} is VALID [2022-02-21 04:30:56,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {737#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#true} assume !(0 != ~mode4~0 % 256); {737#true} is VALID [2022-02-21 04:30:56,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {737#true} is VALID [2022-02-21 04:30:56,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {737#true} is VALID [2022-02-21 04:30:56,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {737#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {737#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {737#true} assume !(node5_~m5~0#1 != ~nomsg~0); {737#true} is VALID [2022-02-21 04:30:56,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {737#true} ~mode5~0 := 0; {737#true} is VALID [2022-02-21 04:30:56,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {737#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {737#true} assume !(0 != ~mode6~0 % 256); {737#true} is VALID [2022-02-21 04:30:56,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {737#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {737#true} is VALID [2022-02-21 04:30:56,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {737#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {737#true} is VALID [2022-02-21 04:30:56,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {737#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {737#true} assume !(0 != ~mode7~0 % 256); {737#true} is VALID [2022-02-21 04:30:56,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {737#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {737#true} is VALID [2022-02-21 04:30:56,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {737#true} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {737#true} is VALID [2022-02-21 04:30:56,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {737#true} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {737#true} is VALID [2022-02-21 04:30:56,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {737#true} assume !(0 != ~mode8~0 % 256); {737#true} is VALID [2022-02-21 04:30:56,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {737#true} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {737#true} is VALID [2022-02-21 04:30:56,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {737#true} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {737#true} is VALID [2022-02-21 04:30:56,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {737#true} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {737#true} is VALID [2022-02-21 04:30:56,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {737#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {739#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:56,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {739#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {740#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:56,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {740#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {741#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:56,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {741#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {738#false} is VALID [2022-02-21 04:30:56,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {738#false} assume { :end_inline_assert } true; {738#false} is VALID [2022-02-21 04:30:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:56,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:56,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070120830] [2022-02-21 04:30:56,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070120830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:56,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:56,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:56,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591404065] [2022-02-21 04:30:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:56,955 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:56,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:56,956 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,315 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-02-21 04:30:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:57,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:57,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 188 transitions. [2022-02-21 04:30:57,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:57,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 141 states and 183 transitions. [2022-02-21 04:30:57,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-02-21 04:30:57,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-02-21 04:30:57,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 183 transitions. [2022-02-21 04:30:57,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:57,359 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 183 transitions. [2022-02-21 04:30:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-21 04:30:57,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:57,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,365 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,365 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,369 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-02-21 04:30:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:57,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 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 141 states and 183 transitions. [2022-02-21 04:30:57,371 INFO L87 Difference]: Start difference. First operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 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 141 states and 183 transitions. [2022-02-21 04:30:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,375 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-02-21 04:30:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:57,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:57,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.297872340425532) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2022-02-21 04:30:57,380 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:57,381 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-02-21 04:30:57,381 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:57,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 183 transitions. [2022-02-21 04:30:57,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:30:57,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:57,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:57,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:57,383 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, 1, 1, 1] [2022-02-21 04:30:57,384 INFO L791 eck$LassoCheckResult]: Stem: 1029#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 953#L297 assume 0 == ~r1~0 % 256; 944#L298 assume ~id1~0 >= 0; 945#L299 assume 0 == ~st1~0; 961#L300 assume ~send1~0 == ~id1~0; 1002#L301 assume 0 == ~mode1~0 % 256; 1014#L302 assume ~id2~0 >= 0; 1015#L303 assume 0 == ~st2~0; 1021#L304 assume ~send2~0 == ~id2~0; 993#L305 assume 0 == ~mode2~0 % 256; 994#L306 assume ~id3~0 >= 0; 1010#L307 assume 0 == ~st3~0; 906#L308 assume ~send3~0 == ~id3~0; 907#L309 assume 0 == ~mode3~0 % 256; 1006#L310 assume ~id4~0 >= 0; 976#L311 assume 0 == ~st4~0; 977#L312 assume ~send4~0 == ~id4~0; 927#L313 assume 0 == ~mode4~0 % 256; 928#L314 assume ~id5~0 >= 0; 967#L315 assume 0 == ~st5~0; 968#L316 assume ~send5~0 == ~id5~0; 894#L317 assume 0 == ~mode5~0 % 256; 895#L318 assume ~id6~0 >= 0; 1030#L319 assume 0 == ~st6~0; 1013#L320 assume ~send6~0 == ~id6~0; 999#L321 assume 0 == ~mode6~0 % 256; 1000#L322 assume ~id7~0 >= 0; 890#L323 assume 0 == ~st7~0; 891#L324 assume ~send7~0 == ~id7~0; 915#L325 assume 0 == ~mode7~0 % 256; 932#L326 assume ~id8~0 >= 0; 918#L327 assume 0 == ~st8~0; 919#L328 assume ~send8~0 == ~id8~0; 954#L329 assume 0 == ~mode8~0 % 256; 955#L330 assume ~id1~0 != ~id2~0; 904#L331 assume ~id1~0 != ~id3~0; 905#L332 assume ~id1~0 != ~id4~0; 931#L333 assume ~id1~0 != ~id5~0; 952#L334 assume ~id1~0 != ~id6~0; 925#L335 assume ~id1~0 != ~id7~0; 926#L336 assume ~id1~0 != ~id8~0; 1009#L337 assume ~id2~0 != ~id3~0; 981#L338 assume ~id2~0 != ~id4~0; 982#L339 assume ~id2~0 != ~id5~0; 1024#L340 assume ~id2~0 != ~id6~0; 1019#L341 assume ~id2~0 != ~id7~0; 956#L342 assume ~id2~0 != ~id8~0; 957#L343 assume ~id3~0 != ~id4~0; 941#L344 assume ~id3~0 != ~id5~0; 942#L345 assume ~id3~0 != ~id6~0; 969#L346 assume ~id3~0 != ~id7~0; 970#L347 assume ~id3~0 != ~id8~0; 1027#L348 assume ~id4~0 != ~id5~0; 1016#L349 assume ~id4~0 != ~id6~0; 1017#L350 assume ~id4~0 != ~id7~0; 1003#L351 assume ~id4~0 != ~id8~0; 1004#L352 assume ~id5~0 != ~id6~0; 1020#L353 assume ~id5~0 != ~id7~0; 989#L354 assume ~id5~0 != ~id8~0; 958#L355 assume ~id6~0 != ~id7~0; 959#L356 assume ~id6~0 != ~id8~0; 986#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 951#L297-1 init_#res#1 := init_~tmp~0#1; 899#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 900#L24 assume !(0 == assume_abort_if_not_~cond#1); 910#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 911#L632-2 [2022-02-21 04:30:57,384 INFO L793 eck$LassoCheckResult]: Loop: 911#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1028#L94 assume !(0 != ~mode1~0 % 256); 920#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 921#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 917#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 972#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 922#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 923#L123-1 ~mode2~0 := 0; 930#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 943#L145 assume !(0 != ~mode3~0 % 256); 914#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 908#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 909#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 983#L170 assume !(0 != ~mode4~0 % 256); 936#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 937#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 960#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 975#L195 assume !(0 != ~mode5~0 % 256); 1025#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1026#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 1008#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 995#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 996#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 892#L223-1 ~mode6~0 := 0; 893#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 933#L245 assume !(0 != ~mode7~0 % 256); 934#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 950#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 1007#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 901#L270 assume !(0 != ~mode8~0 % 256); 902#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 912#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 913#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 998#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 947#L551 assume ~r1~0 % 256 >= 8; 948#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 966#L550-1 check_#res#1 := check_~tmp~1#1; 962#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 963#L670 assume !(0 == assert_~arg#1 % 256); 974#L665 assume { :end_inline_assert } true; 911#L632-2 [2022-02-21 04:30:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 2 times [2022-02-21 04:30:57,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642789171] [2022-02-21 04:30:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,473 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2095246885, now seen corresponding path program 1 times [2022-02-21 04:30:57,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198588438] [2022-02-21 04:30:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {1318#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1318#true} assume !(0 != ~mode1~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1318#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {1318#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {1318#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1318#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {1318#true} assume !(node2_~m2~0#1 != ~nomsg~0); {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1318#true} ~mode2~0 := 0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1318#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {1318#true} assume !(0 != ~mode3~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {1318#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1318#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1318#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {1318#true} assume !(0 != ~mode4~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1318#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {1318#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {1318#true} assume !(0 != ~mode5~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1318#true} is VALID [2022-02-21 04:30:57,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {1318#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {1318#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {1318#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {1318#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1318#true} is VALID [2022-02-21 04:30:57,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {1318#true} ~mode6~0 := 0; {1318#true} is VALID [2022-02-21 04:30:57,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {1318#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#true} assume !(0 != ~mode7~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {1318#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {1318#true} is VALID [2022-02-21 04:30:57,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {1318#true} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {1318#true} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {1318#true} is VALID [2022-02-21 04:30:57,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {1318#true} assume !(0 != ~mode8~0 % 256); {1318#true} is VALID [2022-02-21 04:30:57,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {1318#true} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {1318#true} is VALID [2022-02-21 04:30:57,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {1318#true} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {1318#true} is VALID [2022-02-21 04:30:57,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {1318#true} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1318#true} is VALID [2022-02-21 04:30:57,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {1318#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {1318#true} is VALID [2022-02-21 04:30:57,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {1318#true} assume ~r1~0 % 256 >= 8; {1320#(not (<= ~r1~0 (+ 7 (* (div ~r1~0 256) 256))))} is VALID [2022-02-21 04:30:57,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {1320#(not (<= ~r1~0 (+ 7 (* (div ~r1~0 256) 256))))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {1319#false} is VALID [2022-02-21 04:30:57,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {1319#false} check_#res#1 := check_~tmp~1#1; {1319#false} is VALID [2022-02-21 04:30:57,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {1319#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1319#false} is VALID [2022-02-21 04:30:57,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {1319#false} assume !(0 == assert_~arg#1 % 256); {1319#false} is VALID [2022-02-21 04:30:57,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {1319#false} assume { :end_inline_assert } true; {1319#false} is VALID [2022-02-21 04:30:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:57,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:57,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198588438] [2022-02-21 04:30:57,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198588438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:57,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:57,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:57,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479534637] [2022-02-21 04:30:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:57,553 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:57,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:57,554 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. cyclomatic complexity: 43 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,774 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:57,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:57,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-02-21 04:30:57,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2022-02-21 04:30:57,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-02-21 04:30:57,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-02-21 04:30:57,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:57,802 INFO L681 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-02-21 04:30:57,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:57,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,813 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,815 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,818 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 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 209 states and 288 transitions. [2022-02-21 04:30:57,820 INFO L87 Difference]: Start difference. First operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 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 209 states and 288 transitions. [2022-02-21 04:30:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:57,824 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2022-02-21 04:30:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:57,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:57,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:57,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.3779904306220097) internal successors, (288), 208 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2022-02-21 04:30:57,830 INFO L704 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:57,830 INFO L587 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-02-21 04:30:57,830 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:57,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2022-02-21 04:30:57,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 142 [2022-02-21 04:30:57,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:57,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:57,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:57,833 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, 1, 1, 1, 1] [2022-02-21 04:30:57,835 INFO L791 eck$LassoCheckResult]: Stem: 1670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 1603#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1591#L297 assume 0 == ~r1~0 % 256; 1581#L298 assume ~id1~0 >= 0; 1582#L299 assume 0 == ~st1~0; 1599#L300 assume ~send1~0 == ~id1~0; 1641#L301 assume 0 == ~mode1~0 % 256; 1653#L302 assume ~id2~0 >= 0; 1654#L303 assume 0 == ~st2~0; 1662#L304 assume ~send2~0 == ~id2~0; 1632#L305 assume 0 == ~mode2~0 % 256; 1633#L306 assume ~id3~0 >= 0; 1649#L307 assume 0 == ~st3~0; 1546#L308 assume ~send3~0 == ~id3~0; 1547#L309 assume 0 == ~mode3~0 % 256; 1645#L310 assume ~id4~0 >= 0; 1614#L311 assume 0 == ~st4~0; 1615#L312 assume ~send4~0 == ~id4~0; 1567#L313 assume 0 == ~mode4~0 % 256; 1568#L314 assume ~id5~0 >= 0; 1604#L315 assume 0 == ~st5~0; 1605#L316 assume ~send5~0 == ~id5~0; 1532#L317 assume 0 == ~mode5~0 % 256; 1533#L318 assume ~id6~0 >= 0; 1671#L319 assume 0 == ~st6~0; 1652#L320 assume ~send6~0 == ~id6~0; 1638#L321 assume 0 == ~mode6~0 % 256; 1639#L322 assume ~id7~0 >= 0; 1530#L323 assume 0 == ~st7~0; 1531#L324 assume ~send7~0 == ~id7~0; 1555#L325 assume 0 == ~mode7~0 % 256; 1572#L326 assume ~id8~0 >= 0; 1558#L327 assume 0 == ~st8~0; 1559#L328 assume ~send8~0 == ~id8~0; 1593#L329 assume 0 == ~mode8~0 % 256; 1594#L330 assume ~id1~0 != ~id2~0; 1544#L331 assume ~id1~0 != ~id3~0; 1545#L332 assume ~id1~0 != ~id4~0; 1571#L333 assume ~id1~0 != ~id5~0; 1592#L334 assume ~id1~0 != ~id6~0; 1565#L335 assume ~id1~0 != ~id7~0; 1566#L336 assume ~id1~0 != ~id8~0; 1648#L337 assume ~id2~0 != ~id3~0; 1620#L338 assume ~id2~0 != ~id4~0; 1621#L339 assume ~id2~0 != ~id5~0; 1665#L340 assume ~id2~0 != ~id6~0; 1658#L341 assume ~id2~0 != ~id7~0; 1595#L342 assume ~id2~0 != ~id8~0; 1596#L343 assume ~id3~0 != ~id4~0; 1583#L344 assume ~id3~0 != ~id5~0; 1584#L345 assume ~id3~0 != ~id6~0; 1608#L346 assume ~id3~0 != ~id7~0; 1609#L347 assume ~id3~0 != ~id8~0; 1668#L348 assume ~id4~0 != ~id5~0; 1655#L349 assume ~id4~0 != ~id6~0; 1656#L350 assume ~id4~0 != ~id7~0; 1642#L351 assume ~id4~0 != ~id8~0; 1643#L352 assume ~id5~0 != ~id6~0; 1661#L353 assume ~id5~0 != ~id7~0; 1628#L354 assume ~id5~0 != ~id8~0; 1597#L355 assume ~id6~0 != ~id7~0; 1598#L356 assume ~id6~0 != ~id8~0; 1625#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 1590#L297-1 init_#res#1 := init_~tmp~0#1; 1539#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1540#L24 assume !(0 == assume_abort_if_not_~cond#1); 1550#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1551#L632-2 [2022-02-21 04:30:57,835 INFO L793 eck$LassoCheckResult]: Loop: 1551#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1734#L94 assume !(0 != ~mode1~0 % 256); 1733#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1732#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 1557#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1731#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1728#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 1726#L123-1 ~mode2~0 := 0; 1724#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1723#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1720#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 1718#L148-1 ~mode3~0 := 0; 1716#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1715#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1712#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 1710#L173-1 ~mode4~0 := 0; 1708#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1707#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1705#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 1702#L198-1 ~mode5~0 := 0; 1700#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1699#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1697#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 1694#L223-1 ~mode6~0 := 0; 1692#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 1691#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1689#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 1686#L248-1 ~mode7~0 := 0; 1684#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 1683#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1681#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 1678#L273-1 ~mode8~0 := 0; 1676#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1675#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1674#L551 assume !(~r1~0 % 256 >= 8); 1672#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 1673#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 1738#L550-1 check_#res#1 := check_~tmp~1#1; 1737#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1736#L670 assume !(0 == assert_~arg#1 % 256); 1735#L665 assume { :end_inline_assert } true; 1551#L632-2 [2022-02-21 04:30:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 3 times [2022-02-21 04:30:57,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346288394] [2022-02-21 04:30:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,928 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1336028935, now seen corresponding path program 1 times [2022-02-21 04:30:57,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616452318] [2022-02-21 04:30:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:57,949 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2138425658, now seen corresponding path program 1 times [2022-02-21 04:30:57,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:57,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078923087] [2022-02-21 04:30:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:58,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {2164#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {2164#true} is VALID [2022-02-21 04:30:58,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2164#true} is VALID [2022-02-21 04:30:58,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {2164#true} assume 0 == ~r1~0 % 256; {2164#true} is VALID [2022-02-21 04:30:58,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {2164#true} assume ~id1~0 >= 0; {2164#true} is VALID [2022-02-21 04:30:58,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {2164#true} assume 0 == ~st1~0; {2164#true} is VALID [2022-02-21 04:30:58,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {2164#true} assume ~send1~0 == ~id1~0; {2164#true} is VALID [2022-02-21 04:30:58,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {2164#true} assume 0 == ~mode1~0 % 256; {2164#true} is VALID [2022-02-21 04:30:58,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {2164#true} assume ~id2~0 >= 0; {2164#true} is VALID [2022-02-21 04:30:58,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {2164#true} assume 0 == ~st2~0; {2164#true} is VALID [2022-02-21 04:30:58,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {2164#true} assume ~send2~0 == ~id2~0; {2164#true} is VALID [2022-02-21 04:30:58,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {2164#true} assume 0 == ~mode2~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,028 INFO L290 TraceCheckUtils]: 62: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,031 INFO L290 TraceCheckUtils]: 71: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {2166#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {2165#false} assume !(node2_~m2~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {2165#false} ~mode2~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 75: Hoare triple {2165#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {2165#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,032 INFO L290 TraceCheckUtils]: 77: Hoare triple {2165#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {2165#false} ~mode3~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {2165#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {2165#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 81: Hoare triple {2165#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 82: Hoare triple {2165#false} ~mode4~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 83: Hoare triple {2165#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,033 INFO L290 TraceCheckUtils]: 84: Hoare triple {2165#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 85: Hoare triple {2165#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 86: Hoare triple {2165#false} ~mode5~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 87: Hoare triple {2165#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 88: Hoare triple {2165#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {2165#false} assume !(node6_~m6~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 90: Hoare triple {2165#false} ~mode6~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,034 INFO L290 TraceCheckUtils]: 91: Hoare triple {2165#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 92: Hoare triple {2165#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {2165#false} assume !(node7_~m7~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {2165#false} ~mode7~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 95: Hoare triple {2165#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 96: Hoare triple {2165#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 97: Hoare triple {2165#false} assume !(node8_~m8~0#1 != ~nomsg~0); {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 98: Hoare triple {2165#false} ~mode8~0 := 0; {2165#false} is VALID [2022-02-21 04:30:58,035 INFO L290 TraceCheckUtils]: 99: Hoare triple {2165#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {2165#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {2165#false} assume !(~r1~0 % 256 >= 8); {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 102: Hoare triple {2165#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 103: Hoare triple {2165#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {2165#false} check_#res#1 := check_~tmp~1#1; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {2165#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2165#false} is VALID [2022-02-21 04:30:58,036 INFO L290 TraceCheckUtils]: 106: Hoare triple {2165#false} assume !(0 == assert_~arg#1 % 256); {2165#false} is VALID [2022-02-21 04:30:58,037 INFO L290 TraceCheckUtils]: 107: Hoare triple {2165#false} assume { :end_inline_assert } true; {2165#false} is VALID [2022-02-21 04:30:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:58,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:58,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078923087] [2022-02-21 04:30:58,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078923087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:58,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:58,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:58,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738308436] [2022-02-21 04:30:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:59,385 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:59,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:59,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:59,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:59,386 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:59,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:59,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:59,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:59,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:30:59,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:59,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:59,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:59,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:02,926 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:02,926 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:02,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:02,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:02,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:02,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:02,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:02,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:31:02,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:02,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:02,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:02,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:31:02,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:02,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:03,148 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:03,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:03,152 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:03,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:03,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:03,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:03,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:03,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:03,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:03,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:03,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-02-21 04:31:03,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:03,153 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:03,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:03,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:06,974 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:06,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:06,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:06,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:31:06,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:06,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:06,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:06,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:06,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:06,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:06,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:06,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:06,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:31:07,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:31:07,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:31:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:31:07,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:31:07,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:31:07,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:31:07,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:31:07,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:31:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:31:07,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:31:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:31:07,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,449 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:07,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,530 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 04:31:07,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 04:31:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,615 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:31:07,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:31:07,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:31:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,720 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:31:07,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,765 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:31:07,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,802 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:31:07,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,853 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:31:07,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:31:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,895 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:31:07,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,945 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:31:07,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:07,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:07,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,987 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:07,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:31:07,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:07,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,028 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:31:08,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,056 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:31:08,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,092 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:31:08,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,121 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:31:08,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,150 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:31:08,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,195 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:31:08,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,237 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:31:08,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:31:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,278 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:31:08,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:31:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,306 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:31:08,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:31:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,332 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:31:08,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:31:08,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,360 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:31:08,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,398 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:31:08,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:31:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,444 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:31:08,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:31:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,478 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:31:08,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,516 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:31:08,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,558 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:31:08,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:31:08,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,594 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:31:08,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,628 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:31:08,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:08,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:31:08,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,709 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:31:08,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:08,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:08,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 04:31:08,743 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-02-21 04:31:08,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,744 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 04:31:08,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,753 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,753 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,785 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:31:08,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,794 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,795 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,827 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:31:08,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,837 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,839 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:31:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,863 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:31:08,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,873 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,883 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:08,884 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:08,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 04:31:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,906 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 04:31:08,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,917 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,918 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:08,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,943 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 04:31:08,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,953 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,953 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:08,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:31:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:08,978 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:08,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:31:08,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:08,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:08,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:08,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:08,987 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:08,989 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:08,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:08,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,010 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:31:09,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,019 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,021 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,021 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,041 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:31:09,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,049 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,050 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 04:31:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,082 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 04:31:09,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,092 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:09,092 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,135 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:09,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,213 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:31:09,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,221 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,222 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,222 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,254 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,282 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,284 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,284 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:31:09,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 04:31:09,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,377 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:31:09,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,388 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,389 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,427 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:31:09,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,435 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,437 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,437 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,469 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,531 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,531 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:31:09,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,562 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:31:09,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,571 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,572 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,572 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,604 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:31:09,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,612 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,613 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,644 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:31:09,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,653 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,654 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,654 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,686 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:31:09,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,698 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,699 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 04:31:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,726 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:31:09,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,736 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,737 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 04:31:09,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,771 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:31:09,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,782 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,782 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 04:31:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,808 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:31:09,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,818 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,820 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,820 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 04:31:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,852 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:31:09,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:09,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,862 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,863 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:09,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:09,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,897 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:31:09,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,907 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,909 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,909 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:09,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:09,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:09,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:09,937 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:09,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:31:09,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:09,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:09,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:09,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:09,956 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:09,957 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:09,957 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:09,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,007 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:31:10,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,016 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,017 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,017 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,061 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:31:10,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,070 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,071 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,071 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,109 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:31:10,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,119 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,119 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,145 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 04:31:10,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,155 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,156 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,156 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,187 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 04:31:10,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,198 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,200 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,200 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 04:31:10,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,225 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 04:31:10,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,233 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,234 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,254 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 04:31:10,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,262 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,263 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,281 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 04:31:10,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,289 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,289 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,310 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 04:31:10,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,318 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,320 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,320 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,338 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 04:31:10,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,347 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,348 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 04:31:10,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,388 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 04:31:10,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,400 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,402 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 04:31:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,429 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 04:31:10,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,440 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,441 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:10,441 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:10,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,471 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 04:31:10,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,482 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:10,482 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:10,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 04:31:10,507 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-02-21 04:31:10,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,509 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 04:31:10,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,528 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,528 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,563 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 04:31:10,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,578 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,618 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 04:31:10,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,629 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,630 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,654 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-02-21 04:31:10,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,665 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,667 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:10,667 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:10,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,718 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 04:31:10,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,729 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,730 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-02-21 04:31:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,762 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 04:31:10,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,772 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,773 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-02-21 04:31:10,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,800 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-02-21 04:31:10,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,811 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,812 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,842 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-02-21 04:31:10,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,852 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,855 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:10,855 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:10,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-02-21 04:31:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,897 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-02-21 04:31:10,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:10,912 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:10,913 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:10,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:10,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:10,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:10,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,941 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:10,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-02-21 04:31:10,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:10,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:10,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:10,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:10,956 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:10,956 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,048 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:31:11,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,169 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-02-21 04:31:11,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,180 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,182 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,182 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,226 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,249 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,252 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,252 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-02-21 04:31:11,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,307 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,346 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,349 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-02-21 04:31:11,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,402 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-02-21 04:31:11,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,412 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,416 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,416 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-02-21 04:31:11,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,437 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-02-21 04:31:11,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,446 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,446 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,506 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-02-21 04:31:11,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,515 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,533 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,533 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-02-21 04:31:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,554 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-02-21 04:31:11,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,563 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,563 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-02-21 04:31:11,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,581 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-02-21 04:31:11,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,590 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,591 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,591 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,623 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-02-21 04:31:11,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,634 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,636 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-02-21 04:31:11,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,664 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-02-21 04:31:11,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,674 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,675 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,710 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-02-21 04:31:11,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,720 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,720 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,746 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-02-21 04:31:11,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,756 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,758 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,758 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-02-21 04:31:11,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,800 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-02-21 04:31:11,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:11,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,809 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,811 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:11,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:11,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-02-21 04:31:11,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,838 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-02-21 04:31:11,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,848 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,850 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,850 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-02-21 04:31:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,890 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-02-21 04:31:11,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,900 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,902 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,902 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-02-21 04:31:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,942 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-02-21 04:31:11,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:11,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:11,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:11,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:11,952 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:11,954 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:11,954 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:11,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:11,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-02-21 04:31:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:11,994 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:11,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-02-21 04:31:11,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,004 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,006 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:12,006 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:12,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-02-21 04:31:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,037 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-02-21 04:31:12,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,046 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,047 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-02-21 04:31:12,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,073 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-02-21 04:31:12,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,083 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,086 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:12,086 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:12,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-02-21 04:31:12,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,115 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-02-21 04:31:12,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,126 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,128 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:12,128 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:12,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-02-21 04:31:12,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,160 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-02-21 04:31:12,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,170 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,172 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,199 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-02-21 04:31:12,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,209 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,210 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-02-21 04:31:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,245 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-02-21 04:31:12,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,254 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,254 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,289 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-02-21 04:31:12,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,299 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,301 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:12,301 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:12,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-02-21 04:31:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,330 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-02-21 04:31:12,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,340 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,341 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,371 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-02-21 04:31:12,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,381 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,382 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,417 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-02-21 04:31:12,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,429 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,431 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:12,431 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:12,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,469 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-02-21 04:31:12,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,479 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:12,480 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:12,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,497 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-02-21 04:31:12,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,498 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-02-21 04:31:12,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,511 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,511 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,539 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-02-21 04:31:12,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,548 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,550 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,572 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-02-21 04:31:12,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,581 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,581 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-02-21 04:31:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,600 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-02-21 04:31:12,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,610 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,613 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:12,613 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:12,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,650 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-02-21 04:31:12,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,661 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,663 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,699 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,711 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,712 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-02-21 04:31:12,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,745 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,766 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,767 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-02-21 04:31:12,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,808 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,818 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,820 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:12,820 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:12,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-02-21 04:31:12,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,853 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-02-21 04:31:12,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:12,863 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,865 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:12,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:12,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:12,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:12,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:12,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:12,904 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:12,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-02-21 04:31:12,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:12,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:12,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:12,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:12,917 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:12,917 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:12,981 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-02-21 04:31:12,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,082 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-02-21 04:31:13,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,092 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,095 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,095 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,133 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-02-21 04:31:13,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,142 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,144 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,144 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,182 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-02-21 04:31:13,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,190 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,200 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,247 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-02-21 04:31:13,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,259 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,262 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,263 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,300 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-02-21 04:31:13,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,308 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,308 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,344 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-02-21 04:31:13,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,351 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,353 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,353 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,387 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,400 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,400 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-02-21 04:31:13,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,433 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-02-21 04:31:13,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,441 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,443 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,443 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,477 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-02-21 04:31:13,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,485 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,487 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,548 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-02-21 04:31:13,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,557 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,558 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,596 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-02-21 04:31:13,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,605 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,606 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-02-21 04:31:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,633 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-02-21 04:31:13,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,642 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,645 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,645 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,684 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-02-21 04:31:13,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,695 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,699 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,730 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-02-21 04:31:13,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,739 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,741 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,742 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-02-21 04:31:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,762 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-02-21 04:31:13,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,771 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,773 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,773 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-02-21 04:31:13,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,805 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-02-21 04:31:13,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 [2022-02-21 04:31:13,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,813 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,815 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,815 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,849 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-02-21 04:31:13,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,856 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,858 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,858 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,891 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-02-21 04:31:13,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:13,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,899 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,900 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:13,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:13,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,933 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-02-21 04:31:13,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,941 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,943 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,943 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:13,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:13,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:13,964 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:13,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-02-21 04:31:13,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:13,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:13,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:13,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:13,973 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:13,976 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:13,977 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:13,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-02-21 04:31:14,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,007 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-02-21 04:31:14,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,015 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,017 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-02-21 04:31:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,035 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-02-21 04:31:14,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,043 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,044 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-02-21 04:31:14,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,071 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-02-21 04:31:14,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,079 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,079 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-02-21 04:31:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,098 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-02-21 04:31:14,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,106 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,109 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:14,109 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:14,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-02-21 04:31:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,139 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-02-21 04:31:14,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,149 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,150 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,187 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-02-21 04:31:14,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,197 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,205 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,232 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-02-21 04:31:14,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,241 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,244 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:14,244 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:14,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,272 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-02-21 04:31:14,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:14,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,281 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:14,287 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:14,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,314 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-02-21 04:31:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,315 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-02-21 04:31:14,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,324 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,324 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,324 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,325 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,350 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-02-21 04:31:14,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,360 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,361 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,361 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,363 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,391 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-02-21 04:31:14,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,398 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,398 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,398 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,399 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,423 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-02-21 04:31:14,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,430 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,430 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,431 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,433 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:14,433 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:14,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,478 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-02-21 04:31:14,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,486 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,487 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,487 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,488 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,527 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-02-21 04:31:14,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,535 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,535 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,535 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,536 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,572 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-02-21 04:31:14,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,580 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,580 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,580 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,582 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,640 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-02-21 04:31:14,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,677 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,677 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,678 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,679 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:14,679 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:14,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-02-21 04:31:14,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,714 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-02-21 04:31:14,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,722 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,722 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,722 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,724 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:14,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-02-21 04:31:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,743 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-02-21 04:31:14,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,753 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,753 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:14,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,754 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:14,754 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,814 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:14,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:14,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,941 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-02-21 04:31:14,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,949 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,949 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,949 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,950 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:14,950 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:14,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:14,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:14,983 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-02-21 04:31:14,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:14,991 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:14,991 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:14,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:14,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:14,991 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:14,992 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:14,992 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,024 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-02-21 04:31:15,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,031 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,032 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,032 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,033 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,064 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,085 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,085 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,085 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,086 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,086 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-02-21 04:31:15,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,144 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-02-21 04:31:15,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,151 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,151 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,151 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,152 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,183 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-02-21 04:31:15,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,190 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,190 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,190 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,191 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,191 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,215 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-02-21 04:31:15,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,222 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,222 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,222 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,223 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,255 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-02-21 04:31:15,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,262 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,262 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,262 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,264 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,264 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,292 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-02-21 04:31:15,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,299 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,299 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,299 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,300 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,332 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-02-21 04:31:15,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,339 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,339 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,339 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,340 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,365 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-02-21 04:31:15,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,373 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,373 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,373 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,373 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2022-02-21 04:31:15,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,399 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2022-02-21 04:31:15,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,406 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,407 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,407 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,408 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,408 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,428 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-02-21 04:31:15,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,435 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,435 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,436 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,437 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,457 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-02-21 04:31:15,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,464 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,464 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,464 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,473 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,473 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,493 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-02-21 04:31:15,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,500 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,500 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,501 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,502 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,502 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,522 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-02-21 04:31:15,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,530 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,530 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,530 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,532 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,532 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,551 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-02-21 04:31:15,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,559 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,560 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,560 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,561 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,561 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,582 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-02-21 04:31:15,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,591 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,591 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,591 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,592 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,610 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-02-21 04:31:15,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,618 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,618 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,618 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,619 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,620 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2022-02-21 04:31:15,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,639 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-02-21 04:31:15,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,648 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,648 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,648 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,650 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,650 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,685 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-02-21 04:31:15,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,693 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,693 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,693 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,695 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,722 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-02-21 04:31:15,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,730 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,731 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,731 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,732 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2022-02-21 04:31:15,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,752 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-02-21 04:31:15,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,761 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,761 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,762 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,784 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2022-02-21 04:31:15,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,793 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,793 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,794 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,796 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,796 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,844 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2022-02-21 04:31:15,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,853 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,853 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,853 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,854 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2022-02-21 04:31:15,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,888 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2022-02-21 04:31:15,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,897 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,897 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,898 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,900 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,929 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2022-02-21 04:31:15,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,940 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,940 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,940 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,942 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2022-02-21 04:31:15,942 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2022-02-21 04:31:15,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:15,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,971 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2022-02-21 04:31:15,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:15,980 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:15,981 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:15,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:15,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:15,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:15,981 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-02-21 04:31:15,982 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-02-21 04:31:15,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:15,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2022-02-21 04:31:16,013 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-02-21 04:31:16,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,017 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-02-21 04:31:16,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,025 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,025 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,026 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,027 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2022-02-21 04:31:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,060 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,070 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,070 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,070 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-02-21 04:31:16,072 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,094 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-02-21 04:31:16,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,101 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,101 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,101 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,102 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,120 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-02-21 04:31:16,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,127 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,127 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,128 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,129 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:16,129 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:16,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,159 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-02-21 04:31:16,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,166 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,166 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,166 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,167 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,197 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-02-21 04:31:16,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,204 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,204 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,205 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,205 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,227 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-02-21 04:31:16,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,234 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,234 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,234 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,236 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,262 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-02-21 04:31:16,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,270 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,270 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,270 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,274 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:16,274 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:16,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,300 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2022-02-21 04:31:16,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,307 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,307 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,308 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,309 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,347 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2022-02-21 04:31:16,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,360 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,360 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,360 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:16,360 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,475 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:31:16,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,873 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2022-02-21 04:31:16,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,884 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,884 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,884 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,886 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:16,886 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:16,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,924 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2022-02-21 04:31:16,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,936 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,937 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,937 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,939 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:16,939 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:16,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,971 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:16,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2022-02-21 04:31:16,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:16,980 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:16,980 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:16,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,981 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:16,982 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:16,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2022-02-21 04:31:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,021 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,042 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,042 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,043 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,045 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,046 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2022-02-21 04:31:17,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2022-02-21 04:31:17,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,077 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2022-02-21 04:31:17,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,085 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,085 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,086 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,086 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,113 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2022-02-21 04:31:17,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,123 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,124 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,133 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,133 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2022-02-21 04:31:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,159 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2022-02-21 04:31:17,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,169 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,169 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,169 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,170 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,211 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,223 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,223 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,223 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,225 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,225 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2022-02-21 04:31:17,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,260 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2022-02-21 04:31:17,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 [2022-02-21 04:31:17,269 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,269 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,269 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,271 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,300 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2022-02-21 04:31:17,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,309 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,309 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,309 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,310 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,334 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2022-02-21 04:31:17,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,342 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,343 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,343 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,344 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2022-02-21 04:31:17,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,385 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,398 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,398 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,398 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,400 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,400 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2022-02-21 04:31:17,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,429 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2022-02-21 04:31:17,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,439 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,440 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,440 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,442 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,468 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2022-02-21 04:31:17,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,478 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,479 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,479 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,481 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,481 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,510 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2022-02-21 04:31:17,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,518 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,518 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,518 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,520 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,520 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2022-02-21 04:31:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,577 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2022-02-21 04:31:17,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,586 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,586 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,586 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,588 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,588 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,686 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,718 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,719 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,719 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,721 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,721 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2022-02-21 04:31:17,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,759 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2022-02-21 04:31:17,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 [2022-02-21 04:31:17,769 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,769 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,769 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,770 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,796 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2022-02-21 04:31:17,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,805 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,805 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,805 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,807 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,807 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2022-02-21 04:31:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,845 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2022-02-21 04:31:17,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,854 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,854 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,854 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,856 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:17,856 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:17,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,894 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2022-02-21 04:31:17,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,903 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,903 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,903 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,905 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,946 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2022-02-21 04:31:17,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,956 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,956 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,957 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,959 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,985 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2022-02-21 04:31:17,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:17,993 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:17,993 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:17,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,994 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:17,994 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:17,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2022-02-21 04:31:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,019 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2022-02-21 04:31:18,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,028 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,028 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:18,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,028 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:18,030 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:18,030 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:18,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,063 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2022-02-21 04:31:18,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,072 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,072 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:18,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,073 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:18,074 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:18,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,107 INFO L229 MonitoredProcess]: Starting monitored process 229 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2022-02-21 04:31:18,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,117 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,117 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:18,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,117 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:18,119 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:18,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2022-02-21 04:31:18,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,148 INFO L229 MonitoredProcess]: Starting monitored process 230 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2022-02-21 04:31:18,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,157 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,157 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:18,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,158 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:18,160 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:18,160 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:18,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,211 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2022-02-21 04:31:18,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,221 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,221 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-02-21 04:31:18,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,222 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:18,223 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:18,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2022-02-21 04:31:18,255 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-02-21 04:31:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,257 INFO L229 MonitoredProcess]: Starting monitored process 232 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2022-02-21 04:31:18,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,266 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,266 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,266 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,267 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2022-02-21 04:31:18,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,295 INFO L229 MonitoredProcess]: Starting monitored process 233 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2022-02-21 04:31:18,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,305 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,305 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,306 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,308 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,344 INFO L229 MonitoredProcess]: Starting monitored process 234 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2022-02-21 04:31:18,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,352 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,352 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,353 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,354 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,381 INFO L229 MonitoredProcess]: Starting monitored process 235 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2022-02-21 04:31:18,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,389 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,389 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,389 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,391 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:18,391 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:18,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,425 INFO L229 MonitoredProcess]: Starting monitored process 236 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2022-02-21 04:31:18,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,433 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,433 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,433 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,435 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,457 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2022-02-21 04:31:18,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,466 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,467 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,467 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,468 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,489 INFO L229 MonitoredProcess]: Starting monitored process 238 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2022-02-21 04:31:18,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,496 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,497 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,497 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,499 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,533 INFO L229 MonitoredProcess]: Starting monitored process 239 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2022-02-21 04:31:18,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,541 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,541 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,541 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,543 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:18,543 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:18,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,566 INFO L229 MonitoredProcess]: Starting monitored process 240 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2022-02-21 04:31:18,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,575 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,575 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,576 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,578 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:18,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,603 INFO L229 MonitoredProcess]: Starting monitored process 241 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2022-02-21 04:31:18,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,615 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,615 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:18,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,616 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:18,616 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,694 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-02-21 04:31:18,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:18,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,943 INFO L229 MonitoredProcess]: Starting monitored process 242 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2022-02-21 04:31:18,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,952 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,952 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,952 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,955 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:18,955 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:18,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:18,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2022-02-21 04:31:18,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:18,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:18,978 INFO L229 MonitoredProcess]: Starting monitored process 243 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:18,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2022-02-21 04:31:18,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:18,986 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:18,986 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:18,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:18,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:18,986 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:18,988 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:18,988 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2022-02-21 04:31:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,018 INFO L229 MonitoredProcess]: Starting monitored process 244 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2022-02-21 04:31:19,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,025 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,026 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,026 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,028 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2022-02-21 04:31:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,060 INFO L229 MonitoredProcess]: Starting monitored process 245 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2022-02-21 04:31:19,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,068 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,068 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,068 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,070 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,071 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2022-02-21 04:31:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,093 INFO L229 MonitoredProcess]: Starting monitored process 246 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2022-02-21 04:31:19,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,103 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,103 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,104 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,110 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2022-02-21 04:31:19,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,139 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2022-02-21 04:31:19,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,147 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,147 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,148 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,150 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,150 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,184 INFO L229 MonitoredProcess]: Starting monitored process 248 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2022-02-21 04:31:19,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,192 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,192 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,193 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,193 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,226 INFO L229 MonitoredProcess]: Starting monitored process 249 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2022-02-21 04:31:19,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,234 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,234 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,234 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,236 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,236 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2022-02-21 04:31:19,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,269 INFO L229 MonitoredProcess]: Starting monitored process 250 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2022-02-21 04:31:19,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,277 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,277 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,277 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,279 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,311 INFO L229 MonitoredProcess]: Starting monitored process 251 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2022-02-21 04:31:19,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,322 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,322 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,323 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,323 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,353 INFO L229 MonitoredProcess]: Starting monitored process 252 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2022-02-21 04:31:19,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,363 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,363 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,363 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,390 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,429 INFO L229 MonitoredProcess]: Starting monitored process 253 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2022-02-21 04:31:19,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,440 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,441 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,441 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,443 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,443 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,477 INFO L229 MonitoredProcess]: Starting monitored process 254 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2022-02-21 04:31:19,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,533 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,533 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,534 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,536 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,572 INFO L229 MonitoredProcess]: Starting monitored process 255 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2022-02-21 04:31:19,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,583 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,583 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,583 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,586 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,586 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,658 INFO L229 MonitoredProcess]: Starting monitored process 256 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2022-02-21 04:31:19,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,672 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,673 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,673 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,675 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,675 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2022-02-21 04:31:19,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,700 INFO L229 MonitoredProcess]: Starting monitored process 257 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2022-02-21 04:31:19,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,709 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,709 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,709 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,711 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,712 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2022-02-21 04:31:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,736 INFO L229 MonitoredProcess]: Starting monitored process 258 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2022-02-21 04:31:19,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,745 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,745 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,745 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,747 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,747 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,784 INFO L229 MonitoredProcess]: Starting monitored process 259 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2022-02-21 04:31:19,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,795 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,795 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,796 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,797 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,833 INFO L229 MonitoredProcess]: Starting monitored process 260 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2022-02-21 04:31:19,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,843 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,843 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,844 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,846 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,846 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,881 INFO L229 MonitoredProcess]: Starting monitored process 261 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2022-02-21 04:31:19,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,890 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,890 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,890 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,892 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:19,892 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:19,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,926 INFO L229 MonitoredProcess]: Starting monitored process 262 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2022-02-21 04:31:19,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,936 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,936 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,936 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,939 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2022-02-21 04:31:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,963 INFO L229 MonitoredProcess]: Starting monitored process 263 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2022-02-21 04:31:19,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:19,972 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:19,972 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:19,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:19,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:19,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:19,973 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:19,974 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:19,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:19,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:19,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:19,998 INFO L229 MonitoredProcess]: Starting monitored process 264 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:19,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2022-02-21 04:31:20,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,007 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,007 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,008 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,008 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:20,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,029 INFO L229 MonitoredProcess]: Starting monitored process 265 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2022-02-21 04:31:20,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,038 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,038 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,038 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,040 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:20,040 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:20,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,066 INFO L229 MonitoredProcess]: Starting monitored process 266 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2022-02-21 04:31:20,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,076 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,076 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,076 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,078 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:20,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2022-02-21 04:31:20,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,101 INFO L229 MonitoredProcess]: Starting monitored process 267 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2022-02-21 04:31:20,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,110 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,110 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,110 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,113 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:20,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2022-02-21 04:31:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,145 INFO L229 MonitoredProcess]: Starting monitored process 268 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2022-02-21 04:31:20,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,156 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,156 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,156 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,159 INFO L401 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2022-02-21 04:31:20,159 INFO L402 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2022-02-21 04:31:20,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,193 INFO L229 MonitoredProcess]: Starting monitored process 269 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2022-02-21 04:31:20,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,205 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,205 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:20,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,206 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-02-21 04:31:20,208 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-02-21 04:31:20,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,242 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-02-21 04:31:20,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,245 INFO L229 MonitoredProcess]: Starting monitored process 270 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2022-02-21 04:31:20,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,256 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,257 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,257 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,258 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,285 INFO L229 MonitoredProcess]: Starting monitored process 271 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2022-02-21 04:31:20,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,295 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,295 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,295 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,297 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,329 INFO L229 MonitoredProcess]: Starting monitored process 272 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2022-02-21 04:31:20,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,339 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,339 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,339 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,340 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,367 INFO L229 MonitoredProcess]: Starting monitored process 273 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2022-02-21 04:31:20,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,378 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,379 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,379 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,381 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:20,381 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:20,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,426 INFO L229 MonitoredProcess]: Starting monitored process 274 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2022-02-21 04:31:20,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,434 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,434 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,434 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,435 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,461 INFO L229 MonitoredProcess]: Starting monitored process 275 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2022-02-21 04:31:20,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 [2022-02-21 04:31:20,469 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,469 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,470 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,470 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2022-02-21 04:31:20,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,498 INFO L229 MonitoredProcess]: Starting monitored process 276 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2022-02-21 04:31:20,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,509 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,509 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,509 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,511 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,536 INFO L229 MonitoredProcess]: Starting monitored process 277 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2022-02-21 04:31:20,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,546 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,546 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,546 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,548 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:20,548 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:20,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2022-02-21 04:31:20,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,574 INFO L229 MonitoredProcess]: Starting monitored process 278 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2022-02-21 04:31:20,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,585 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,586 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,586 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,588 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,625 INFO L229 MonitoredProcess]: Starting monitored process 279 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2022-02-21 04:31:20,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,638 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,638 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,639 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:20,639 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,697 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 04:31:20,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,862 INFO L229 MonitoredProcess]: Starting monitored process 280 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2022-02-21 04:31:20,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,873 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,873 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,873 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,875 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:20,875 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:20,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,898 INFO L229 MonitoredProcess]: Starting monitored process 281 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2022-02-21 04:31:20,908 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,908 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,908 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,910 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:20,910 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:20,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:20,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,935 INFO L229 MonitoredProcess]: Starting monitored process 282 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2022-02-21 04:31:20,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,943 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,943 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:20,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,944 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,945 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:20,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:20,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:20,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2022-02-21 04:31:20,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:20,965 INFO L229 MonitoredProcess]: Starting monitored process 283 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:20,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2022-02-21 04:31:20,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:20,974 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:20,974 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:20,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:20,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:20,974 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:20,976 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:20,976 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:20,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,007 INFO L229 MonitoredProcess]: Starting monitored process 284 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2022-02-21 04:31:21,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,017 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,018 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,018 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,018 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,042 INFO L229 MonitoredProcess]: Starting monitored process 285 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2022-02-21 04:31:21,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,052 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,052 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,052 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,054 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,054 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,076 INFO L229 MonitoredProcess]: Starting monitored process 286 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2022-02-21 04:31:21,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,084 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,084 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,084 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,085 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,112 INFO L229 MonitoredProcess]: Starting monitored process 287 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2022-02-21 04:31:21,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,121 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,121 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,121 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,123 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,123 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,152 INFO L229 MonitoredProcess]: Starting monitored process 288 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2022-02-21 04:31:21,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,161 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,161 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,161 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,162 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2022-02-21 04:31:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,183 INFO L229 MonitoredProcess]: Starting monitored process 289 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2022-02-21 04:31:21,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,193 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,193 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,193 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,194 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,219 INFO L229 MonitoredProcess]: Starting monitored process 290 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2022-02-21 04:31:21,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,229 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,229 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,229 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,230 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,254 INFO L229 MonitoredProcess]: Starting monitored process 291 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2022-02-21 04:31:21,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,262 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,263 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,263 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,264 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,264 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2022-02-21 04:31:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,285 INFO L229 MonitoredProcess]: Starting monitored process 292 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2022-02-21 04:31:21,309 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,309 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,309 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,310 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,331 INFO L229 MonitoredProcess]: Starting monitored process 293 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2022-02-21 04:31:21,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,339 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,339 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,340 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,341 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,341 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,368 INFO L229 MonitoredProcess]: Starting monitored process 294 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2022-02-21 04:31:21,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,375 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,376 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,376 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,377 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,377 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,404 INFO L229 MonitoredProcess]: Starting monitored process 295 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2022-02-21 04:31:21,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,413 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,413 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,413 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,415 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,415 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,447 INFO L229 MonitoredProcess]: Starting monitored process 296 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2022-02-21 04:31:21,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,455 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,455 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,455 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,457 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,457 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,489 INFO L229 MonitoredProcess]: Starting monitored process 297 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2022-02-21 04:31:21,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,498 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,498 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,498 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,498 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,530 INFO L229 MonitoredProcess]: Starting monitored process 298 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2022-02-21 04:31:21,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,539 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,539 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,539 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,541 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,541 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,576 INFO L229 MonitoredProcess]: Starting monitored process 299 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2022-02-21 04:31:21,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,584 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,584 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,584 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,586 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,586 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,616 INFO L229 MonitoredProcess]: Starting monitored process 300 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2022-02-21 04:31:21,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,625 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,625 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,625 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,626 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,652 INFO L229 MonitoredProcess]: Starting monitored process 301 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2022-02-21 04:31:21,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,660 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,660 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,661 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,662 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,694 INFO L229 MonitoredProcess]: Starting monitored process 302 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2022-02-21 04:31:21,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,702 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,702 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,702 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,703 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,734 INFO L229 MonitoredProcess]: Starting monitored process 303 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2022-02-21 04:31:21,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,742 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,742 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,743 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,744 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,744 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,765 INFO L229 MonitoredProcess]: Starting monitored process 304 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2022-02-21 04:31:21,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,773 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,773 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,773 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,774 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,806 INFO L229 MonitoredProcess]: Starting monitored process 305 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2022-02-21 04:31:21,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,814 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,815 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,815 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,816 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,848 INFO L229 MonitoredProcess]: Starting monitored process 306 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2022-02-21 04:31:21,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,857 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,857 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,857 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,858 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 04:31:21,858 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:31:21,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,889 INFO L229 MonitoredProcess]: Starting monitored process 307 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2022-02-21 04:31:21,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,898 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,898 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-02-21 04:31:21,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,898 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-02-21 04:31:21,899 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:31:21,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,919 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-02-21 04:31:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,943 INFO L229 MonitoredProcess]: Starting monitored process 308 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2022-02-21 04:31:21,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,952 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,953 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:21,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,953 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:21,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:21,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:21,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:21,981 INFO L229 MonitoredProcess]: Starting monitored process 309 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:21,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2022-02-21 04:31:21,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:21,989 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:21,989 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:21,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:21,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:21,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:21,989 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:21,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:21,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:21,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,015 INFO L229 MonitoredProcess]: Starting monitored process 310 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2022-02-21 04:31:22,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,050 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,050 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,050 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,070 INFO L229 MonitoredProcess]: Starting monitored process 311 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Waiting until timeout for monitored process [2022-02-21 04:31:22,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,079 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,079 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,079 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,081 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,081 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Ended with exit code 0 [2022-02-21 04:31:22,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,104 INFO L229 MonitoredProcess]: Starting monitored process 312 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Waiting until timeout for monitored process [2022-02-21 04:31:22,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,112 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,112 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,113 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Ended with exit code 0 [2022-02-21 04:31:22,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,134 INFO L229 MonitoredProcess]: Starting monitored process 313 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Waiting until timeout for monitored process [2022-02-21 04:31:22,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,142 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,143 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,143 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,193 INFO L229 MonitoredProcess]: Starting monitored process 314 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Waiting until timeout for monitored process [2022-02-21 04:31:22,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,202 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,202 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,202 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,225 INFO L229 MonitoredProcess]: Starting monitored process 315 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Waiting until timeout for monitored process [2022-02-21 04:31:22,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,234 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,234 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,234 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,237 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,237 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,270 INFO L229 MonitoredProcess]: Starting monitored process 316 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Waiting until timeout for monitored process [2022-02-21 04:31:22,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,278 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,278 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,278 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Ended with exit code 0 [2022-02-21 04:31:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,307 INFO L229 MonitoredProcess]: Starting monitored process 317 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Waiting until timeout for monitored process [2022-02-21 04:31:22,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,320 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,320 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,320 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:31:22,320 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,445 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2022-02-21 04:31:22,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,687 INFO L229 MonitoredProcess]: Starting monitored process 318 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Waiting until timeout for monitored process [2022-02-21 04:31:22,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,695 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,695 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,695 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,698 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,698 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,728 INFO L229 MonitoredProcess]: Starting monitored process 319 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Waiting until timeout for monitored process [2022-02-21 04:31:22,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,739 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,739 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,740 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,744 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,744 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Ended with exit code 0 [2022-02-21 04:31:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,774 INFO L229 MonitoredProcess]: Starting monitored process 320 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Waiting until timeout for monitored process [2022-02-21 04:31:22,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,783 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,783 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,783 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,816 INFO L229 MonitoredProcess]: Starting monitored process 321 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Waiting until timeout for monitored process [2022-02-21 04:31:22,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,825 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,826 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,826 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,828 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,828 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,851 INFO L229 MonitoredProcess]: Starting monitored process 322 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Waiting until timeout for monitored process [2022-02-21 04:31:22,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,859 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,859 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,859 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,900 INFO L229 MonitoredProcess]: Starting monitored process 323 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Waiting until timeout for monitored process [2022-02-21 04:31:22,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,908 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,908 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,908 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,911 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:22,911 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:22,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,952 INFO L229 MonitoredProcess]: Starting monitored process 324 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Waiting until timeout for monitored process [2022-02-21 04:31:22,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:22,961 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:22,961 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:22,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:22,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:22,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:22,961 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:22,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:22,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:22,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:22,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:22,993 INFO L229 MonitoredProcess]: Starting monitored process 325 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:22,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Waiting until timeout for monitored process [2022-02-21 04:31:22,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,003 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,003 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,003 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,006 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,006 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,034 INFO L229 MonitoredProcess]: Starting monitored process 326 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Waiting until timeout for monitored process [2022-02-21 04:31:23,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,043 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,043 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,043 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (326)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,075 INFO L229 MonitoredProcess]: Starting monitored process 327 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Waiting until timeout for monitored process [2022-02-21 04:31:23,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,085 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,085 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,085 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,112 INFO L229 MonitoredProcess]: Starting monitored process 328 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Waiting until timeout for monitored process [2022-02-21 04:31:23,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 [2022-02-21 04:31:23,123 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,123 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,123 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,156 INFO L229 MonitoredProcess]: Starting monitored process 329 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Waiting until timeout for monitored process [2022-02-21 04:31:23,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,164 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,164 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,164 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,168 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,168 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,190 INFO L229 MonitoredProcess]: Starting monitored process 330 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Waiting until timeout for monitored process [2022-02-21 04:31:23,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,198 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,199 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,199 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Ended with exit code 0 [2022-02-21 04:31:23,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,233 INFO L229 MonitoredProcess]: Starting monitored process 331 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Waiting until timeout for monitored process [2022-02-21 04:31:23,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,241 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,241 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,241 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,243 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,244 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,266 INFO L229 MonitoredProcess]: Starting monitored process 332 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Waiting until timeout for monitored process [2022-02-21 04:31:23,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,275 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,275 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,276 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,278 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,278 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Ended with exit code 0 [2022-02-21 04:31:23,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,319 INFO L229 MonitoredProcess]: Starting monitored process 333 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Waiting until timeout for monitored process [2022-02-21 04:31:23,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,328 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,328 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,328 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,331 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,331 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Ended with exit code 0 [2022-02-21 04:31:23,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,358 INFO L229 MonitoredProcess]: Starting monitored process 334 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Waiting until timeout for monitored process [2022-02-21 04:31:23,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,369 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,369 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,369 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,372 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,372 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,401 INFO L229 MonitoredProcess]: Starting monitored process 335 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Waiting until timeout for monitored process [2022-02-21 04:31:23,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,409 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,409 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,409 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,434 INFO L229 MonitoredProcess]: Starting monitored process 336 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Waiting until timeout for monitored process [2022-02-21 04:31:23,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,444 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,444 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,445 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,449 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,449 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Ended with exit code 0 [2022-02-21 04:31:23,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,503 INFO L229 MonitoredProcess]: Starting monitored process 337 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Waiting until timeout for monitored process [2022-02-21 04:31:23,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,537 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,538 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,538 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,540 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,540 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,585 INFO L229 MonitoredProcess]: Starting monitored process 338 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Waiting until timeout for monitored process [2022-02-21 04:31:23,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,593 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,593 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,594 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,649 INFO L229 MonitoredProcess]: Starting monitored process 339 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Waiting until timeout for monitored process [2022-02-21 04:31:23,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,659 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,659 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,660 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,696 INFO L229 MonitoredProcess]: Starting monitored process 340 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Waiting until timeout for monitored process [2022-02-21 04:31:23,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,705 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,705 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,705 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,737 INFO L229 MonitoredProcess]: Starting monitored process 341 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Waiting until timeout for monitored process [2022-02-21 04:31:23,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,744 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,744 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,744 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,747 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,747 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,770 INFO L229 MonitoredProcess]: Starting monitored process 342 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Waiting until timeout for monitored process [2022-02-21 04:31:23,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,778 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,778 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,778 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,801 INFO L229 MonitoredProcess]: Starting monitored process 343 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Waiting until timeout for monitored process [2022-02-21 04:31:23,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,811 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,811 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,812 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,845 INFO L229 MonitoredProcess]: Starting monitored process 344 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Waiting until timeout for monitored process [2022-02-21 04:31:23,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,854 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,854 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,854 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,857 INFO L401 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2022-02-21 04:31:23,857 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 04:31:23,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:23,889 INFO L229 MonitoredProcess]: Starting monitored process 345 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:23,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Waiting until timeout for monitored process [2022-02-21 04:31:23,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:23,899 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-02-21 04:31:23,899 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-02-21 04:31:23,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:23,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:23,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:23,900 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-02-21 04:31:23,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:31:23,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:23,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:23,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Ended with exit code 0 [2022-02-21 04:31:23,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:23,929 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:24,165 INFO L93 Difference]: Finished difference Result 339 states and 487 transitions. [2022-02-21 04:31:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:24,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:24,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 272 [2022-02-21 04:31:24,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 339 states to 339 states and 487 transitions. [2022-02-21 04:31:24,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2022-02-21 04:31:24,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2022-02-21 04:31:24,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:24,273 INFO L681 BuchiCegarLoop]: Abstraction has 339 states and 487 transitions. [2022-02-21 04:31:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-02-21 04:31:24,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:24,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states and 487 transitions. Second operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,296 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states and 487 transitions. Second operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,297 INFO L87 Difference]: Start difference. First operand 339 states and 487 transitions. Second operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:24,322 INFO L93 Difference]: Finished difference Result 339 states and 487 transitions. [2022-02-21 04:31:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:24,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:24,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 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 339 states and 487 transitions. [2022-02-21 04:31:24,325 INFO L87 Difference]: Start difference. First operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 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 339 states and 487 transitions. [2022-02-21 04:31:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:24,334 INFO L93 Difference]: Finished difference Result 339 states and 487 transitions. [2022-02-21 04:31:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:24,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:24,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:24,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 339 states have (on average 1.4365781710914454) internal successors, (487), 338 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 487 transitions. [2022-02-21 04:31:24,344 INFO L704 BuchiCegarLoop]: Abstraction has 339 states and 487 transitions. [2022-02-21 04:31:24,344 INFO L587 BuchiCegarLoop]: Abstraction has 339 states and 487 transitions. [2022-02-21 04:31:24,344 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:31:24,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 487 transitions. [2022-02-21 04:31:24,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 272 [2022-02-21 04:31:24,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:24,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:24,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:24,349 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:24,350 INFO L791 eck$LassoCheckResult]: Stem: 2667#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 2582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 2568#L297 assume 0 == ~r1~0 % 256; 2557#L298 assume ~id1~0 >= 0; 2558#L299 assume 0 == ~st1~0; 2578#L300 assume ~send1~0 == ~id1~0; 2626#L301 assume 0 == ~mode1~0 % 256; 2642#L302 assume ~id2~0 >= 0; 2643#L303 assume 0 == ~st2~0; 2652#L304 assume ~send2~0 == ~id2~0; 2614#L305 assume 0 == ~mode2~0 % 256; 2615#L306 assume ~id3~0 >= 0; 2637#L307 assume 0 == ~st3~0; 2522#L308 assume ~send3~0 == ~id3~0; 2523#L309 assume 0 == ~mode3~0 % 256; 2631#L310 assume ~id4~0 >= 0; 2594#L311 assume 0 == ~st4~0; 2595#L312 assume ~send4~0 == ~id4~0; 2543#L313 assume 0 == ~mode4~0 % 256; 2544#L314 assume ~id5~0 >= 0; 2583#L315 assume 0 == ~st5~0; 2584#L316 assume ~send5~0 == ~id5~0; 2508#L317 assume 0 == ~mode5~0 % 256; 2509#L318 assume ~id6~0 >= 0; 2668#L319 assume 0 == ~st6~0; 2641#L320 assume ~send6~0 == ~id6~0; 2622#L321 assume 0 == ~mode6~0 % 256; 2623#L322 assume ~id7~0 >= 0; 2506#L323 assume 0 == ~st7~0; 2507#L324 assume ~send7~0 == ~id7~0; 2531#L325 assume 0 == ~mode7~0 % 256; 2548#L326 assume ~id8~0 >= 0; 2534#L327 assume 0 == ~st8~0; 2535#L328 assume ~send8~0 == ~id8~0; 2572#L329 assume 0 == ~mode8~0 % 256; 2573#L330 assume ~id1~0 != ~id2~0; 2520#L331 assume ~id1~0 != ~id3~0; 2521#L332 assume ~id1~0 != ~id4~0; 2547#L333 assume ~id1~0 != ~id5~0; 2569#L334 assume ~id1~0 != ~id6~0; 2541#L335 assume ~id1~0 != ~id7~0; 2542#L336 assume ~id1~0 != ~id8~0; 2636#L337 assume ~id2~0 != ~id3~0; 2601#L338 assume ~id2~0 != ~id4~0; 2602#L339 assume ~id2~0 != ~id5~0; 2655#L340 assume ~id2~0 != ~id6~0; 2647#L341 assume ~id2~0 != ~id7~0; 2574#L342 assume ~id2~0 != ~id8~0; 2575#L343 assume ~id3~0 != ~id4~0; 2559#L344 assume ~id3~0 != ~id5~0; 2560#L345 assume ~id3~0 != ~id6~0; 2587#L346 assume ~id3~0 != ~id7~0; 2588#L347 assume ~id3~0 != ~id8~0; 2662#L348 assume ~id4~0 != ~id5~0; 2644#L349 assume ~id4~0 != ~id6~0; 2645#L350 assume ~id4~0 != ~id7~0; 2628#L351 assume ~id4~0 != ~id8~0; 2629#L352 assume ~id5~0 != ~id6~0; 2650#L353 assume ~id5~0 != ~id7~0; 2609#L354 assume ~id5~0 != ~id8~0; 2576#L355 assume ~id6~0 != ~id7~0; 2577#L356 assume ~id6~0 != ~id8~0; 2606#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 2567#L297-1 init_#res#1 := init_~tmp~0#1; 2515#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2516#L24 assume !(0 == assume_abort_if_not_~cond#1); 2526#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2527#L632-2 [2022-02-21 04:31:24,350 INFO L793 eck$LassoCheckResult]: Loop: 2527#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 2803#L94 assume !(0 != ~mode1~0 % 256); 2802#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 2801#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 2533#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 2590#L120 assume !(0 != ~mode2~0 % 256); 2591#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 2661#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 2787#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 2785#L145 assume !(0 != ~mode3~0 % 256); 2784#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 2770#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 2765#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 2764#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 2759#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 2756#L173-1 ~mode4~0 := 0; 2753#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 2752#L195 assume !(0 != ~mode5~0 % 256); 2748#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 2742#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 2739#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 2738#L220 assume !(0 != ~mode6~0 % 256); 2737#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 2730#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 2597#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 2549#L245 assume !(0 != ~mode7~0 % 256); 2550#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 2632#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 2633#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 2698#L270 assume !(0 != ~mode8~0 % 256); 2692#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 2693#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 2681#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2682#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 2675#L551 assume !(~r1~0 % 256 >= 8); 2676#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 2709#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 2702#L550-1 check_#res#1 := check_~tmp~1#1; 2580#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2581#L670 assume !(0 == assert_~arg#1 % 256); 2593#L665 assume { :end_inline_assert } true; 2648#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 2664#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 2665#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 2684#L98-1 ~mode1~0 := 0; 2680#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 2677#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 2538#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 2539#L123-1 ~mode2~0 := 0; 2786#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 2783#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 2780#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 2778#L148-1 ~mode3~0 := 0; 2776#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 2772#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 2768#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 2762#L173-1 ~mode4~0 := 0; 2757#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 2754#L195 assume !(0 != ~mode5~0 % 256); 2744#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 2740#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 2736#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 2732#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 2728#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 2725#L223-1 ~mode6~0 := 0; 2723#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 2722#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 2721#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 2718#L248-1 ~mode7~0 := 0; 2717#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 2716#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 2696#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 2690#L273-1 ~mode8~0 := 0; 2689#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2678#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 2679#L551 assume !(~r1~0 % 256 >= 8); 2673#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 2674#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 2807#L550-1 check_#res#1 := check_~tmp~1#1; 2806#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2805#L670 assume !(0 == assert_~arg#1 % 256); 2804#L665 assume { :end_inline_assert } true; 2527#L632-2 [2022-02-21 04:31:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 4 times [2022-02-21 04:31:24,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:24,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459788326] [2022-02-21 04:31:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:24,406 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:24,456 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1000964929, now seen corresponding path program 1 times [2022-02-21 04:31:24,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:24,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654038363] [2022-02-21 04:31:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:24,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {3528#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3528#true} assume !(0 != ~mode1~0 % 256); {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {3528#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {3528#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {3528#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {3528#true} assume !(0 != ~mode2~0 % 256); {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {3528#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {3528#true} is VALID [2022-02-21 04:31:24,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {3528#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {3528#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {3528#true} assume !(0 != ~mode3~0 % 256); {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {3528#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {3528#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {3528#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3528#true} is VALID [2022-02-21 04:31:24,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {3528#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3528#true} is VALID [2022-02-21 04:31:24,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {3528#true} assume !(node4_~m4~0#1 != ~nomsg~0); {3528#true} is VALID [2022-02-21 04:31:24,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {3528#true} ~mode4~0 := 0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode5~0 % 256); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode6~0 % 256); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode7~0 % 256); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 != ~mode8~0 % 256); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(~r1~0 % 256 >= 8); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} check_#res#1 := check_~tmp~1#1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(0 == assert_~arg#1 % 256); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_assert } true; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node1_~m1~0#1 != ~nomsg~0); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode1~0 := 0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,562 INFO L290 TraceCheckUtils]: 46: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node2_~m2~0#1 != ~nomsg~0); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode2~0 := 0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume !(node3_~m3~0#1 != ~nomsg~0); {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} ~mode3~0 := 0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {3530#(and (not (<= (+ (div ~mode4~0 256) 1) 0)) (<= ~mode4~0 (* (div ~mode4~0 256) 256)))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {3529#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {3529#false} ~mode4~0 := 0; {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {3529#false} assume !(0 != ~mode5~0 % 256); {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {3529#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3529#false} is VALID [2022-02-21 04:31:24,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {3529#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {3529#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {3529#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {3529#false} assume !(node6_~m6~0#1 != ~nomsg~0); {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {3529#false} ~mode6~0 := 0; {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {3529#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {3529#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {3529#false} assume !(node7_~m7~0#1 != ~nomsg~0); {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {3529#false} ~mode7~0 := 0; {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {3529#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {3529#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {3529#false} assume !(node8_~m8~0#1 != ~nomsg~0); {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {3529#false} ~mode8~0 := 0; {3529#false} is VALID [2022-02-21 04:31:24,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {3529#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {3529#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {3529#false} assume !(~r1~0 % 256 >= 8); {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {3529#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {3529#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {3529#false} check_#res#1 := check_~tmp~1#1; {3529#false} is VALID [2022-02-21 04:31:24,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {3529#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3529#false} is VALID [2022-02-21 04:31:24,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {3529#false} assume !(0 == assert_~arg#1 % 256); {3529#false} is VALID [2022-02-21 04:31:24,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {3529#false} assume { :end_inline_assert } true; {3529#false} is VALID [2022-02-21 04:31:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:24,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:24,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654038363] [2022-02-21 04:31:24,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654038363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:24,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:24,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:24,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378258426] [2022-02-21 04:31:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:24,572 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:24,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:24,573 INFO L87 Difference]: Start difference. First operand 339 states and 487 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:24,857 INFO L93 Difference]: Finished difference Result 595 states and 875 transitions. [2022-02-21 04:31:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:24,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:24,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 875 transitions. [2022-02-21 04:31:24,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 528 [2022-02-21 04:31:24,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 875 transitions. [2022-02-21 04:31:24,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 595 [2022-02-21 04:31:24,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2022-02-21 04:31:24,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 875 transitions. [2022-02-21 04:31:24,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:24,984 INFO L681 BuchiCegarLoop]: Abstraction has 595 states and 875 transitions. [2022-02-21 04:31:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 875 transitions. [2022-02-21 04:31:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 587. [2022-02-21 04:31:24,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:24,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states and 875 transitions. Second operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:24,999 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states and 875 transitions. Second operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,000 INFO L87 Difference]: Start difference. First operand 595 states and 875 transitions. Second operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:25,018 INFO L93 Difference]: Finished difference Result 595 states and 875 transitions. [2022-02-21 04:31:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 875 transitions. [2022-02-21 04:31:25,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:25,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:25,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 595 states and 875 transitions. [2022-02-21 04:31:25,022 INFO L87 Difference]: Start difference. First operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 595 states and 875 transitions. [2022-02-21 04:31:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:25,039 INFO L93 Difference]: Finished difference Result 595 states and 875 transitions. [2022-02-21 04:31:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 875 transitions. [2022-02-21 04:31:25,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:25,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:25,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:25,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 587 states have (on average 1.4701873935264054) internal successors, (863), 586 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 863 transitions. [2022-02-21 04:31:25,058 INFO L704 BuchiCegarLoop]: Abstraction has 587 states and 863 transitions. [2022-02-21 04:31:25,058 INFO L587 BuchiCegarLoop]: Abstraction has 587 states and 863 transitions. [2022-02-21 04:31:25,059 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:31:25,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 863 transitions. [2022-02-21 04:31:25,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 520 [2022-02-21 04:31:25,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:25,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:25,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:25,063 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:25,063 INFO L791 eck$LassoCheckResult]: Stem: 4281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 4204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 4189#L297 assume 0 == ~r1~0 % 256; 4178#L298 assume ~id1~0 >= 0; 4179#L299 assume 0 == ~st1~0; 4199#L300 assume ~send1~0 == ~id1~0; 4245#L301 assume 0 == ~mode1~0 % 256; 4257#L302 assume ~id2~0 >= 0; 4258#L303 assume 0 == ~st2~0; 4268#L304 assume ~send2~0 == ~id2~0; 4236#L305 assume 0 == ~mode2~0 % 256; 4237#L306 assume ~id3~0 >= 0; 4253#L307 assume 0 == ~st3~0; 4142#L308 assume ~send3~0 == ~id3~0; 4143#L309 assume 0 == ~mode3~0 % 256; 4249#L310 assume ~id4~0 >= 0; 4217#L311 assume 0 == ~st4~0; 4218#L312 assume ~send4~0 == ~id4~0; 4164#L313 assume 0 == ~mode4~0 % 256; 4165#L314 assume ~id5~0 >= 0; 4205#L315 assume 0 == ~st5~0; 4206#L316 assume ~send5~0 == ~id5~0; 4128#L317 assume 0 == ~mode5~0 % 256; 4129#L318 assume ~id6~0 >= 0; 4282#L319 assume 0 == ~st6~0; 4256#L320 assume ~send6~0 == ~id6~0; 4242#L321 assume 0 == ~mode6~0 % 256; 4243#L322 assume ~id7~0 >= 0; 4126#L323 assume 0 == ~st7~0; 4127#L324 assume ~send7~0 == ~id7~0; 4154#L325 assume 0 == ~mode7~0 % 256; 4169#L326 assume ~id8~0 >= 0; 4155#L327 assume 0 == ~st8~0; 4156#L328 assume ~send8~0 == ~id8~0; 4193#L329 assume 0 == ~mode8~0 % 256; 4194#L330 assume ~id1~0 != ~id2~0; 4140#L331 assume ~id1~0 != ~id3~0; 4141#L332 assume ~id1~0 != ~id4~0; 4168#L333 assume ~id1~0 != ~id5~0; 4190#L334 assume ~id1~0 != ~id6~0; 4162#L335 assume ~id1~0 != ~id7~0; 4163#L336 assume ~id1~0 != ~id8~0; 4252#L337 assume ~id2~0 != ~id3~0; 4223#L338 assume ~id2~0 != ~id4~0; 4224#L339 assume ~id2~0 != ~id5~0; 4271#L340 assume ~id2~0 != ~id6~0; 4262#L341 assume ~id2~0 != ~id7~0; 4195#L342 assume ~id2~0 != ~id8~0; 4196#L343 assume ~id3~0 != ~id4~0; 4180#L344 assume ~id3~0 != ~id5~0; 4181#L345 assume ~id3~0 != ~id6~0; 4209#L346 assume ~id3~0 != ~id7~0; 4210#L347 assume ~id3~0 != ~id8~0; 4276#L348 assume ~id4~0 != ~id5~0; 4259#L349 assume ~id4~0 != ~id6~0; 4260#L350 assume ~id4~0 != ~id7~0; 4246#L351 assume ~id4~0 != ~id8~0; 4247#L352 assume ~id5~0 != ~id6~0; 4265#L353 assume ~id5~0 != ~id7~0; 4232#L354 assume ~id5~0 != ~id8~0; 4197#L355 assume ~id6~0 != ~id7~0; 4198#L356 assume ~id6~0 != ~id8~0; 4229#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 4188#L297-1 init_#res#1 := init_~tmp~0#1; 4135#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 4136#L24 assume !(0 == assume_abort_if_not_~cond#1); 4146#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 4147#L632-2 [2022-02-21 04:31:25,063 INFO L793 eck$LassoCheckResult]: Loop: 4147#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 4556#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 4355#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 4152#L98-1 ~mode1~0 := 0; 4153#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 4550#L120 assume !(0 != ~mode2~0 % 256); 4337#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 4334#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 4329#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 4330#L145 assume !(0 != ~mode3~0 % 256); 4526#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 4522#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 4520#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 4517#L170 assume !(0 != ~mode4~0 % 256); 4515#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 4514#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 4513#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 4512#L195 assume !(0 != ~mode5~0 % 256); 4508#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 4506#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 4505#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 4504#L220 assume !(0 != ~mode6~0 % 256); 4500#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 4498#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 4497#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 4496#L245 assume !(0 != ~mode7~0 % 256); 4492#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 4490#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 4489#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 4488#L270 assume !(0 != ~mode8~0 % 256); 4484#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 4482#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 4481#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 4480#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 4478#L551 assume !(~r1~0 % 256 >= 8); 4477#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 4475#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 4474#L550-1 check_#res#1 := check_~tmp~1#1; 4473#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 4472#L670 assume !(0 == assert_~arg#1 % 256); 4471#L665 assume { :end_inline_assert } true; 4362#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 4363#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 4305#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 4298#L98-1 ~mode1~0 := 0; 4299#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 4344#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 4159#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 4160#L123-1 ~mode2~0 := 0; 4463#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 4460#L145 assume !(0 != ~mode3~0 % 256); 4455#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 4451#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 4447#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 4444#L170 assume !(0 != ~mode4~0 % 256); 4445#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 4622#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 4621#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 4620#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 4618#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 4615#L198-1 ~mode5~0 := 0; 4613#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 4612#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 4610#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 4607#L223-1 ~mode6~0 := 0; 4605#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 4604#L245 assume !(0 != ~mode7~0 % 256); 4516#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 4327#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 4324#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 4322#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 4321#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 4312#L273-1 ~mode8~0 := 0; 4294#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 4290#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 4286#L551 assume !(~r1~0 % 256 >= 8); 4284#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 4285#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 4565#L550-1 check_#res#1 := check_~tmp~1#1; 4563#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 4561#L670 assume !(0 == assert_~arg#1 % 256); 4559#L665 assume { :end_inline_assert } true; 4147#L632-2 [2022-02-21 04:31:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 5 times [2022-02-21 04:31:25,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:25,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959618966] [2022-02-21 04:31:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:25,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:25,137 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1501629609, now seen corresponding path program 1 times [2022-02-21 04:31:25,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:25,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599812995] [2022-02-21 04:31:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:25,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {5908#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5908#true} is VALID [2022-02-21 04:31:25,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {5908#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {5908#true} is VALID [2022-02-21 04:31:25,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {5908#true} assume !(node1_~m1~0#1 != ~nomsg~0); {5908#true} is VALID [2022-02-21 04:31:25,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {5908#true} ~mode1~0 := 0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode2~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode3~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode4~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode5~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode6~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode7~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 != ~mode8~0 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(~r1~0 % 256 >= 8); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} check_#res#1 := check_~tmp~1#1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !(0 == assert_~arg#1 % 256); {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume { :end_inline_assert } true; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {5910#(and (<= ~mode1~0 (* 256 (div ~mode1~0 256))) (not (<= (+ (div ~mode1~0 256) 1) 0)))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {5909#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5909#false} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#false} ~mode1~0 := 0; {5909#false} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {5909#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {5909#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {5909#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {5909#false} ~mode2~0 := 0; {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {5909#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {5909#false} assume !(0 != ~mode3~0 % 256); {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {5909#false} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {5909#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {5909#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {5909#false} assume !(0 != ~mode4~0 % 256); {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {5909#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {5909#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {5909#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {5909#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {5909#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5909#false} is VALID [2022-02-21 04:31:25,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {5909#false} ~mode5~0 := 0; {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {5909#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {5909#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {5909#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {5909#false} ~mode6~0 := 0; {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {5909#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {5909#false} assume !(0 != ~mode7~0 % 256); {5909#false} is VALID [2022-02-21 04:31:25,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {5909#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {5909#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {5909#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {5909#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {5909#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {5909#false} ~mode8~0 := 0; {5909#false} is VALID [2022-02-21 04:31:25,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {5909#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {5909#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 75: Hoare triple {5909#false} assume !(~r1~0 % 256 >= 8); {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {5909#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {5909#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {5909#false} check_#res#1 := check_~tmp~1#1; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {5909#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5909#false} is VALID [2022-02-21 04:31:25,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {5909#false} assume !(0 == assert_~arg#1 % 256); {5909#false} is VALID [2022-02-21 04:31:25,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {5909#false} assume { :end_inline_assert } true; {5909#false} is VALID [2022-02-21 04:31:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:25,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:25,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599812995] [2022-02-21 04:31:25,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599812995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:25,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:25,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:25,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539395082] [2022-02-21 04:31:25,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:25,241 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:25,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:25,242 INFO L87 Difference]: Start difference. First operand 587 states and 863 transitions. cyclomatic complexity: 277 Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:25,471 INFO L93 Difference]: Finished difference Result 879 states and 1291 transitions. [2022-02-21 04:31:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:25,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:25,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 879 states and 1291 transitions. [2022-02-21 04:31:25,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 812 [2022-02-21 04:31:25,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 879 states to 879 states and 1291 transitions. [2022-02-21 04:31:25,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 879 [2022-02-21 04:31:25,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 879 [2022-02-21 04:31:25,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1291 transitions. [2022-02-21 04:31:25,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:25,613 INFO L681 BuchiCegarLoop]: Abstraction has 879 states and 1291 transitions. [2022-02-21 04:31:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1291 transitions. [2022-02-21 04:31:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 863. [2022-02-21 04:31:25,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:25,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 879 states and 1291 transitions. Second operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,629 INFO L74 IsIncluded]: Start isIncluded. First operand 879 states and 1291 transitions. Second operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,630 INFO L87 Difference]: Start difference. First operand 879 states and 1291 transitions. Second operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:25,663 INFO L93 Difference]: Finished difference Result 879 states and 1291 transitions. [2022-02-21 04:31:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1291 transitions. [2022-02-21 04:31:25,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:25,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:25,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 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 879 states and 1291 transitions. [2022-02-21 04:31:25,669 INFO L87 Difference]: Start difference. First operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 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 879 states and 1291 transitions. [2022-02-21 04:31:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:25,702 INFO L93 Difference]: Finished difference Result 879 states and 1291 transitions. [2022-02-21 04:31:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1291 transitions. [2022-02-21 04:31:25,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:25,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:25,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:25,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 863 states have (on average 1.4681344148319815) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1267 transitions. [2022-02-21 04:31:25,738 INFO L704 BuchiCegarLoop]: Abstraction has 863 states and 1267 transitions. [2022-02-21 04:31:25,738 INFO L587 BuchiCegarLoop]: Abstraction has 863 states and 1267 transitions. [2022-02-21 04:31:25,738 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:31:25,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 863 states and 1267 transitions. [2022-02-21 04:31:25,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 796 [2022-02-21 04:31:25,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:25,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:25,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:25,743 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:25,744 INFO L791 eck$LassoCheckResult]: Stem: 6947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 6864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 6852#L297 assume 0 == ~r1~0 % 256; 6843#L298 assume ~id1~0 >= 0; 6844#L299 assume 0 == ~st1~0; 6861#L300 assume ~send1~0 == ~id1~0; 6911#L301 assume 0 == ~mode1~0 % 256; 6924#L302 assume ~id2~0 >= 0; 6925#L303 assume 0 == ~st2~0; 6935#L304 assume ~send2~0 == ~id2~0; 6897#L305 assume 0 == ~mode2~0 % 256; 6898#L306 assume ~id3~0 >= 0; 6920#L307 assume 0 == ~st3~0; 6806#L308 assume ~send3~0 == ~id3~0; 6807#L309 assume 0 == ~mode3~0 % 256; 6916#L310 assume ~id4~0 >= 0; 6878#L311 assume 0 == ~st4~0; 6879#L312 assume ~send4~0 == ~id4~0; 6827#L313 assume 0 == ~mode4~0 % 256; 6828#L314 assume ~id5~0 >= 0; 6867#L315 assume 0 == ~st5~0; 6868#L316 assume ~send5~0 == ~id5~0; 6794#L317 assume 0 == ~mode5~0 % 256; 6795#L318 assume ~id6~0 >= 0; 6948#L319 assume 0 == ~st6~0; 6923#L320 assume ~send6~0 == ~id6~0; 6906#L321 assume 0 == ~mode6~0 % 256; 6907#L322 assume ~id7~0 >= 0; 6790#L323 assume 0 == ~st7~0; 6791#L324 assume ~send7~0 == ~id7~0; 6817#L325 assume 0 == ~mode7~0 % 256; 6835#L326 assume ~id8~0 >= 0; 6818#L327 assume 0 == ~st8~0; 6819#L328 assume ~send8~0 == ~id8~0; 6854#L329 assume 0 == ~mode8~0 % 256; 6855#L330 assume ~id1~0 != ~id2~0; 6804#L331 assume ~id1~0 != ~id3~0; 6805#L332 assume ~id1~0 != ~id4~0; 6831#L333 assume ~id1~0 != ~id5~0; 6853#L334 assume ~id1~0 != ~id6~0; 6825#L335 assume ~id1~0 != ~id7~0; 6826#L336 assume ~id1~0 != ~id8~0; 6919#L337 assume ~id2~0 != ~id3~0; 6885#L338 assume ~id2~0 != ~id4~0; 6886#L339 assume ~id2~0 != ~id5~0; 6938#L340 assume ~id2~0 != ~id6~0; 6929#L341 assume ~id2~0 != ~id7~0; 6856#L342 assume ~id2~0 != ~id8~0; 6857#L343 assume ~id3~0 != ~id4~0; 6845#L344 assume ~id3~0 != ~id5~0; 6846#L345 assume ~id3~0 != ~id6~0; 6869#L346 assume ~id3~0 != ~id7~0; 6870#L347 assume ~id3~0 != ~id8~0; 6942#L348 assume ~id4~0 != ~id5~0; 6926#L349 assume ~id4~0 != ~id6~0; 6927#L350 assume ~id4~0 != ~id7~0; 6913#L351 assume ~id4~0 != ~id8~0; 6914#L352 assume ~id5~0 != ~id6~0; 6934#L353 assume ~id5~0 != ~id7~0; 6893#L354 assume ~id5~0 != ~id8~0; 6858#L355 assume ~id6~0 != ~id7~0; 6859#L356 assume ~id6~0 != ~id8~0; 6892#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 6851#L297-1 init_#res#1 := init_~tmp~0#1; 6799#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 6800#L24 assume !(0 == assume_abort_if_not_~cond#1); 6810#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 6811#L632-2 [2022-02-21 04:31:25,744 INFO L793 eck$LassoCheckResult]: Loop: 6811#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 7345#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 6953#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 6815#L98-1 ~mode1~0 := 0; 6816#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 7303#L120 assume !(0 != ~mode2~0 % 256); 7302#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 7301#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 7299#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 7298#L145 assume !(0 != ~mode3~0 % 256); 7290#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 7286#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 7284#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 7281#L170 assume !(0 != ~mode4~0 % 256); 7280#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 7279#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 7278#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 7277#L195 assume !(0 != ~mode5~0 % 256); 7273#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 7271#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 7270#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 7269#L220 assume !(0 != ~mode6~0 % 256); 7265#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 7263#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 7262#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 7261#L245 assume !(0 != ~mode7~0 % 256); 7257#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 7255#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 7254#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 7253#L270 assume !(0 != ~mode8~0 % 256); 7249#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 7247#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 7246#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 7245#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 7243#L551 assume !(~r1~0 % 256 >= 8); 7242#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 7241#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 7240#L550-1 check_#res#1 := check_~tmp~1#1; 7238#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 7236#L670 assume !(0 == assert_~arg#1 % 256); 7234#L665 assume { :end_inline_assert } true; 7232#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 7230#L94 assume !(0 != ~mode1~0 % 256); 7161#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 7118#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 7116#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 7113#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 7114#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 7424#L123-1 ~mode2~0 := 0; 7421#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 7418#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 7414#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 7411#L148-1 ~mode3~0 := 0; 7405#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 7403#L170 assume !(0 != ~mode4~0 % 256); 7401#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 7400#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 7399#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 7398#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 7396#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 7393#L198-1 ~mode5~0 := 0; 7391#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 7390#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 7388#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 7385#L223-1 ~mode6~0 := 0; 7383#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 7382#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 7380#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 7377#L248-1 ~mode7~0 := 0; 7375#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 7374#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 7372#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 7369#L273-1 ~mode8~0 := 0; 7367#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 7366#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 7363#L551 assume !(~r1~0 % 256 >= 8); 7361#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 7358#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 7356#L550-1 check_#res#1 := check_~tmp~1#1; 7354#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 7352#L670 assume !(0 == assert_~arg#1 % 256); 7350#L665 assume { :end_inline_assert } true; 6811#L632-2 [2022-02-21 04:31:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 6 times [2022-02-21 04:31:25,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:25,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195839310] [2022-02-21 04:31:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:25,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:25,810 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -192109301, now seen corresponding path program 1 times [2022-02-21 04:31:25,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:25,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71492347] [2022-02-21 04:31:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:25,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {9416#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9416#true} is VALID [2022-02-21 04:31:25,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {9416#true} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {9416#true} is VALID [2022-02-21 04:31:25,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {9416#true} assume !(node1_~m1~0#1 != ~nomsg~0); {9416#true} is VALID [2022-02-21 04:31:25,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {9416#true} ~mode1~0 := 0; {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {9416#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {9416#true} assume !(0 != ~mode2~0 % 256); {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {9416#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {9416#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {9416#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {9416#true} assume !(0 != ~mode3~0 % 256); {9416#true} is VALID [2022-02-21 04:31:25,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {9416#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {9416#true} is VALID [2022-02-21 04:31:25,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {9416#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9416#true} is VALID [2022-02-21 04:31:25,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {9416#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9416#true} is VALID [2022-02-21 04:31:25,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {9416#true} assume !(0 != ~mode4~0 % 256); {9416#true} is VALID [2022-02-21 04:31:25,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {9416#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9416#true} is VALID [2022-02-21 04:31:25,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {9416#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode5~0 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode6~0 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode7~0 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode8~0 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(~r1~0 % 256 >= 8); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} check_#res#1 := check_~tmp~1#1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 == assert_~arg#1 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_assert } true; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode1~0 % 256); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~mode2~0 := 0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(node3_~m3~0#1 != ~nomsg~0); {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} ~mode3~0 := 0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} is VALID [2022-02-21 04:31:25,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {9418#(and (<= (div ~mode4~0 256) 0) (<= 1 ~mode4~0))} assume !(0 != ~mode4~0 % 256); {9417#false} is VALID [2022-02-21 04:31:25,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {9417#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {9417#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {9417#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {9417#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {9417#false} assume !(node5_~m5~0#1 != ~nomsg~0); {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {9417#false} ~mode5~0 := 0; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {9417#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,951 INFO L290 TraceCheckUtils]: 62: Hoare triple {9417#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {9417#false} assume !(node6_~m6~0#1 != ~nomsg~0); {9417#false} is VALID [2022-02-21 04:31:25,952 INFO L290 TraceCheckUtils]: 64: Hoare triple {9417#false} ~mode6~0 := 0; {9417#false} is VALID [2022-02-21 04:31:25,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {9417#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {9417#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {9417#false} assume !(node7_~m7~0#1 != ~nomsg~0); {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {9417#false} ~mode7~0 := 0; {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 69: Hoare triple {9417#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {9417#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {9417#false} assume !(node8_~m8~0#1 != ~nomsg~0); {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 72: Hoare triple {9417#false} ~mode8~0 := 0; {9417#false} is VALID [2022-02-21 04:31:25,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {9417#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {9417#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {9417#false} assume !(~r1~0 % 256 >= 8); {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 76: Hoare triple {9417#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 77: Hoare triple {9417#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {9417#false} check_#res#1 := check_~tmp~1#1; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {9417#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9417#false} is VALID [2022-02-21 04:31:25,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {9417#false} assume !(0 == assert_~arg#1 % 256); {9417#false} is VALID [2022-02-21 04:31:25,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {9417#false} assume { :end_inline_assert } true; {9417#false} is VALID [2022-02-21 04:31:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:25,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:25,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71492347] [2022-02-21 04:31:25,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71492347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:25,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:25,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:25,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760553687] [2022-02-21 04:31:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:25,957 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:25,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:25,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:25,958 INFO L87 Difference]: Start difference. First operand 863 states and 1267 transitions. cyclomatic complexity: 405 Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:26,223 INFO L93 Difference]: Finished difference Result 907 states and 1330 transitions. [2022-02-21 04:31:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:26,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:26,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 907 states and 1330 transitions. [2022-02-21 04:31:26,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 796 [2022-02-21 04:31:26,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 907 states to 907 states and 1330 transitions. [2022-02-21 04:31:26,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 907 [2022-02-21 04:31:26,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 907 [2022-02-21 04:31:26,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 907 states and 1330 transitions. [2022-02-21 04:31:26,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:26,391 INFO L681 BuchiCegarLoop]: Abstraction has 907 states and 1330 transitions. [2022-02-21 04:31:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states and 1330 transitions. [2022-02-21 04:31:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 899. [2022-02-21 04:31:26,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:26,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states and 1330 transitions. Second operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,407 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states and 1330 transitions. Second operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,409 INFO L87 Difference]: Start difference. First operand 907 states and 1330 transitions. Second operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:26,445 INFO L93 Difference]: Finished difference Result 907 states and 1330 transitions. [2022-02-21 04:31:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1330 transitions. [2022-02-21 04:31:26,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:26,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:26,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 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 907 states and 1330 transitions. [2022-02-21 04:31:26,451 INFO L87 Difference]: Start difference. First operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 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 907 states and 1330 transitions. [2022-02-21 04:31:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:26,487 INFO L93 Difference]: Finished difference Result 907 states and 1330 transitions. [2022-02-21 04:31:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1330 transitions. [2022-02-21 04:31:26,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:26,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:26,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:26,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 898 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1316 transitions. [2022-02-21 04:31:26,525 INFO L704 BuchiCegarLoop]: Abstraction has 899 states and 1316 transitions. [2022-02-21 04:31:26,525 INFO L587 BuchiCegarLoop]: Abstraction has 899 states and 1316 transitions. [2022-02-21 04:31:26,525 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:31:26,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 899 states and 1316 transitions. [2022-02-21 04:31:26,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 796 [2022-02-21 04:31:26,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:26,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:26,532 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, 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] [2022-02-21 04:31:26,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:26,532 INFO L791 eck$LassoCheckResult]: Stem: 10482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 10403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 10390#L297 assume 0 == ~r1~0 % 256; 10378#L298 assume ~id1~0 >= 0; 10379#L299 assume 0 == ~st1~0; 10398#L300 assume ~send1~0 == ~id1~0; 10446#L301 assume 0 == ~mode1~0 % 256; 10460#L302 assume ~id2~0 >= 0; 10461#L303 assume 0 == ~st2~0; 10470#L304 assume ~send2~0 == ~id2~0; 10437#L305 assume 0 == ~mode2~0 % 256; 10438#L306 assume ~id3~0 >= 0; 10456#L307 assume 0 == ~st3~0; 10342#L308 assume ~send3~0 == ~id3~0; 10343#L309 assume 0 == ~mode3~0 % 256; 10451#L310 assume ~id4~0 >= 0; 10415#L311 assume 0 == ~st4~0; 10416#L312 assume ~send4~0 == ~id4~0; 10364#L313 assume 0 == ~mode4~0 % 256; 10365#L314 assume ~id5~0 >= 0; 10406#L315 assume 0 == ~st5~0; 10407#L316 assume ~send5~0 == ~id5~0; 10328#L317 assume 0 == ~mode5~0 % 256; 10329#L318 assume ~id6~0 >= 0; 10483#L319 assume 0 == ~st6~0; 10459#L320 assume ~send6~0 == ~id6~0; 10443#L321 assume 0 == ~mode6~0 % 256; 10444#L322 assume ~id7~0 >= 0; 10326#L323 assume 0 == ~st7~0; 10327#L324 assume ~send7~0 == ~id7~0; 10354#L325 assume 0 == ~mode7~0 % 256; 10369#L326 assume ~id8~0 >= 0; 10355#L327 assume 0 == ~st8~0; 10356#L328 assume ~send8~0 == ~id8~0; 10392#L329 assume 0 == ~mode8~0 % 256; 10393#L330 assume ~id1~0 != ~id2~0; 10340#L331 assume ~id1~0 != ~id3~0; 10341#L332 assume ~id1~0 != ~id4~0; 10368#L333 assume ~id1~0 != ~id5~0; 10391#L334 assume ~id1~0 != ~id6~0; 10362#L335 assume ~id1~0 != ~id7~0; 10363#L336 assume ~id1~0 != ~id8~0; 10455#L337 assume ~id2~0 != ~id3~0; 10422#L338 assume ~id2~0 != ~id4~0; 10423#L339 assume ~id2~0 != ~id5~0; 10473#L340 assume ~id2~0 != ~id6~0; 10465#L341 assume ~id2~0 != ~id7~0; 10394#L342 assume ~id2~0 != ~id8~0; 10395#L343 assume ~id3~0 != ~id4~0; 10380#L344 assume ~id3~0 != ~id5~0; 10381#L345 assume ~id3~0 != ~id6~0; 10408#L346 assume ~id3~0 != ~id7~0; 10409#L347 assume ~id3~0 != ~id8~0; 10478#L348 assume ~id4~0 != ~id5~0; 10462#L349 assume ~id4~0 != ~id6~0; 10463#L350 assume ~id4~0 != ~id7~0; 10448#L351 assume ~id4~0 != ~id8~0; 10449#L352 assume ~id5~0 != ~id6~0; 10468#L353 assume ~id5~0 != ~id7~0; 10431#L354 assume ~id5~0 != ~id8~0; 10396#L355 assume ~id6~0 != ~id7~0; 10397#L356 assume ~id6~0 != ~id8~0; 10428#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 10389#L297-1 init_#res#1 := init_~tmp~0#1; 10335#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 10336#L24 assume !(0 == assume_abort_if_not_~cond#1); 10346#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 10347#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10480#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 10810#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 11190#L98-1 ~mode1~0 := 0; 11189#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 11188#L120 assume !(0 != ~mode2~0 % 256); 11187#L133 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 11186#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 11185#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 11184#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 11181#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 11179#L148-1 ~mode3~0 := 0; 10424#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 10425#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 10429#L173 [2022-02-21 04:31:26,533 INFO L793 eck$LassoCheckResult]: Loop: 10429#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 10427#L173-1 ~mode4~0 := 0; 11062#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 11057#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 11054#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 11050#L198-1 ~mode5~0 := 0; 11046#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 11041#L220 assume !(0 != ~mode6~0 % 256); 11042#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 11033#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 11031#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 11020#L245 assume !(0 != ~mode7~0 % 256); 11015#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 10873#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 10871#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 10867#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 10863#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 10858#L273-1 ~mode8~0 := 0; 10855#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 10852#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 10850#L551 assume !(~r1~0 % 256 >= 8); 10849#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 10848#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 10847#L550-1 check_#res#1 := check_~tmp~1#1; 10846#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 10845#L670 assume !(0 == assert_~arg#1 % 256); 10844#L665 assume { :end_inline_assert } true; 10843#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10837#L94 assume !(0 != ~mode1~0 % 256); 10836#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 10835#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 10834#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 10797#L120 assume !(0 != ~mode2~0 % 256); 10794#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 10791#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 10792#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 10905#L145 assume !(0 != ~mode3~0 % 256); 10903#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 10900#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 10899#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 10625#L170 assume !(0 != ~mode4~0 % 256); 10624#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 10621#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 10617#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 10618#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 10602#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 10600#L198-1 ~mode5~0 := 0; 10591#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 10592#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 10747#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 10744#L223-1 ~mode6~0 := 0; 10742#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 10741#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 10563#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 10561#L248-1 ~mode7~0 := 0; 10738#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 10737#L270 assume !(0 != ~mode8~0 % 256); 10536#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 10537#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 10732#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 10731#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 10521#L551 assume !(~r1~0 % 256 >= 8); 10518#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 10519#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 10511#L550-1 check_#res#1 := check_~tmp~1#1; 10509#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 10507#L670 assume !(0 == assert_~arg#1 % 256); 10505#L665 assume { :end_inline_assert } true; 10503#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10500#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 10501#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 10495#L98-1 ~mode1~0 := 0; 10491#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 10492#L120 assume !(0 != ~mode2~0 % 256); 11087#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 11170#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 11169#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 11168#L145 assume !(0 != ~mode3~0 % 256); 11164#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 11162#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 11159#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 10447#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 10429#L173 [2022-02-21 04:31:26,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1142129784, now seen corresponding path program 1 times [2022-02-21 04:31:26,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:26,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300149667] [2022-02-21 04:31:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:26,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {13042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {13042#true} is VALID [2022-02-21 04:31:26,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {13042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13042#true} is VALID [2022-02-21 04:31:26,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {13042#true} assume 0 == ~r1~0 % 256; {13042#true} is VALID [2022-02-21 04:31:26,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {13042#true} assume ~id1~0 >= 0; {13042#true} is VALID [2022-02-21 04:31:26,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {13042#true} assume 0 == ~st1~0; {13042#true} is VALID [2022-02-21 04:31:26,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {13042#true} assume ~send1~0 == ~id1~0; {13042#true} is VALID [2022-02-21 04:31:26,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {13042#true} assume 0 == ~mode1~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,612 INFO L290 TraceCheckUtils]: 64: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,612 INFO L290 TraceCheckUtils]: 65: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:31:26,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {13044#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {13043#false} assume !(node1_~m1~0#1 != ~nomsg~0); {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {13043#false} ~mode1~0 := 0; {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {13043#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {13043#false} assume !(0 != ~mode2~0 % 256); {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {13043#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {13043#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13043#false} is VALID [2022-02-21 04:31:26,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {13043#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {13043#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {13043#false} assume !(node3_~m3~0#1 != ~nomsg~0); {13043#false} is VALID [2022-02-21 04:31:26,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {13043#false} ~mode3~0 := 0; {13043#false} is VALID [2022-02-21 04:31:26,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {13043#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {13043#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13043#false} is VALID [2022-02-21 04:31:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:26,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:26,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300149667] [2022-02-21 04:31:26,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300149667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:26,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:26,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:26,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377782979] [2022-02-21 04:31:26,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:26,643 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 111105803, now seen corresponding path program 1 times [2022-02-21 04:31:26,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:26,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915164891] [2022-02-21 04:31:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:26,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {13045#true} assume !(node4_~m4~0#1 != ~nomsg~0); {13045#true} is VALID [2022-02-21 04:31:26,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {13045#true} ~mode4~0 := 0; {13045#true} is VALID [2022-02-21 04:31:26,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {13045#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {13045#true} is VALID [2022-02-21 04:31:26,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {13045#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13045#true} is VALID [2022-02-21 04:31:26,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {13045#true} assume !(node5_~m5~0#1 != ~nomsg~0); {13045#true} is VALID [2022-02-21 04:31:26,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {13045#true} ~mode5~0 := 0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode6~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode7~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node8_~m8~0#1 != ~nomsg~0); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode8~0 := 0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(~r1~0 % 256 >= 8); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} check_#res#1 := check_~tmp~1#1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 == assert_~arg#1 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_assert } true; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode1~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode2~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode3~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode4~0 % 256); {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:26,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {13047#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {13046#false} assume !(node5_~m5~0#1 != ~nomsg~0); {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {13046#false} ~mode5~0 := 0; {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {13046#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {13046#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {13046#false} assume !(node6_~m6~0#1 != ~nomsg~0); {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {13046#false} ~mode6~0 := 0; {13046#false} is VALID [2022-02-21 04:31:26,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {13046#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {13046#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {13046#false} assume !(node7_~m7~0#1 != ~nomsg~0); {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {13046#false} ~mode7~0 := 0; {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {13046#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {13046#false} assume !(0 != ~mode8~0 % 256); {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {13046#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {13046#false} is VALID [2022-02-21 04:31:26,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {13046#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {13046#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {13046#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {13046#false} assume !(~r1~0 % 256 >= 8); {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {13046#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {13046#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {13046#false} is VALID [2022-02-21 04:31:26,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {13046#false} check_#res#1 := check_~tmp~1#1; {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {13046#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {13046#false} assume !(0 == assert_~arg#1 % 256); {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {13046#false} assume { :end_inline_assert } true; {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {13046#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {13046#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {13046#false} assume !(node1_~m1~0#1 != ~nomsg~0); {13046#false} is VALID [2022-02-21 04:31:26,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {13046#false} ~mode1~0 := 0; {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {13046#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {13046#false} assume !(0 != ~mode2~0 % 256); {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {13046#false} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {13046#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {13046#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 77: Hoare triple {13046#false} assume !(0 != ~mode3~0 % 256); {13046#false} is VALID [2022-02-21 04:31:26,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {13046#false} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {13046#false} is VALID [2022-02-21 04:31:26,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {13046#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {13046#false} is VALID [2022-02-21 04:31:26,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {13046#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {13046#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13046#false} is VALID [2022-02-21 04:31:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:26,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:26,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915164891] [2022-02-21 04:31:26,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915164891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:26,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:26,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:26,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195821226] [2022-02-21 04:31:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:26,742 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:26,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:26,743 INFO L87 Difference]: Start difference. First operand 899 states and 1316 transitions. cyclomatic complexity: 418 Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:26,992 INFO L93 Difference]: Finished difference Result 881 states and 1287 transitions. [2022-02-21 04:31:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:26,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:27,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 796 [2022-02-21 04:31:27,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 881 states to 881 states and 1287 transitions. [2022-02-21 04:31:27,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 881 [2022-02-21 04:31:27,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 881 [2022-02-21 04:31:27,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:27,134 INFO L681 BuchiCegarLoop]: Abstraction has 881 states and 1287 transitions. [2022-02-21 04:31:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-02-21 04:31:27,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:27,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 881 states and 1287 transitions. Second operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,148 INFO L74 IsIncluded]: Start isIncluded. First operand 881 states and 1287 transitions. Second operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,149 INFO L87 Difference]: Start difference. First operand 881 states and 1287 transitions. Second operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:27,182 INFO L93 Difference]: Finished difference Result 881 states and 1287 transitions. [2022-02-21 04:31:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:27,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:27,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 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 881 states and 1287 transitions. [2022-02-21 04:31:27,187 INFO L87 Difference]: Start difference. First operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 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 881 states and 1287 transitions. [2022-02-21 04:31:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:27,221 INFO L93 Difference]: Finished difference Result 881 states and 1287 transitions. [2022-02-21 04:31:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:27,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:27,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 881 states have (on average 1.4608399545970487) internal successors, (1287), 880 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1287 transitions. [2022-02-21 04:31:27,256 INFO L704 BuchiCegarLoop]: Abstraction has 881 states and 1287 transitions. [2022-02-21 04:31:27,256 INFO L587 BuchiCegarLoop]: Abstraction has 881 states and 1287 transitions. [2022-02-21 04:31:27,257 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:31:27,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 881 states and 1287 transitions. [2022-02-21 04:31:27,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 796 [2022-02-21 04:31:27,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:27,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:27,262 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, 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] [2022-02-21 04:31:27,262 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:27,262 INFO L791 eck$LassoCheckResult]: Stem: 14082#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 14005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 13993#L297 assume 0 == ~r1~0 % 256; 13981#L298 assume ~id1~0 >= 0; 13982#L299 assume 0 == ~st1~0; 14001#L300 assume ~send1~0 == ~id1~0; 14046#L301 assume 0 == ~mode1~0 % 256; 14059#L302 assume ~id2~0 >= 0; 14060#L303 assume 0 == ~st2~0; 14070#L304 assume ~send2~0 == ~id2~0; 14037#L305 assume 0 == ~mode2~0 % 256; 14038#L306 assume ~id3~0 >= 0; 14055#L307 assume 0 == ~st3~0; 13945#L308 assume ~send3~0 == ~id3~0; 13946#L309 assume 0 == ~mode3~0 % 256; 14050#L310 assume ~id4~0 >= 0; 14017#L311 assume 0 == ~st4~0; 14018#L312 assume ~send4~0 == ~id4~0; 13967#L313 assume 0 == ~mode4~0 % 256; 13968#L314 assume ~id5~0 >= 0; 14006#L315 assume 0 == ~st5~0; 14007#L316 assume ~send5~0 == ~id5~0; 13931#L317 assume 0 == ~mode5~0 % 256; 13932#L318 assume ~id6~0 >= 0; 14083#L319 assume 0 == ~st6~0; 14058#L320 assume ~send6~0 == ~id6~0; 14043#L321 assume 0 == ~mode6~0 % 256; 14044#L322 assume ~id7~0 >= 0; 13929#L323 assume 0 == ~st7~0; 13930#L324 assume ~send7~0 == ~id7~0; 13955#L325 assume 0 == ~mode7~0 % 256; 13972#L326 assume ~id8~0 >= 0; 13958#L327 assume 0 == ~st8~0; 13959#L328 assume ~send8~0 == ~id8~0; 13995#L329 assume 0 == ~mode8~0 % 256; 13996#L330 assume ~id1~0 != ~id2~0; 13943#L331 assume ~id1~0 != ~id3~0; 13944#L332 assume ~id1~0 != ~id4~0; 13971#L333 assume ~id1~0 != ~id5~0; 13994#L334 assume ~id1~0 != ~id6~0; 13965#L335 assume ~id1~0 != ~id7~0; 13966#L336 assume ~id1~0 != ~id8~0; 14054#L337 assume ~id2~0 != ~id3~0; 14023#L338 assume ~id2~0 != ~id4~0; 14024#L339 assume ~id2~0 != ~id5~0; 14073#L340 assume ~id2~0 != ~id6~0; 14064#L341 assume ~id2~0 != ~id7~0; 13997#L342 assume ~id2~0 != ~id8~0; 13998#L343 assume ~id3~0 != ~id4~0; 13983#L344 assume ~id3~0 != ~id5~0; 13984#L345 assume ~id3~0 != ~id6~0; 14010#L346 assume ~id3~0 != ~id7~0; 14011#L347 assume ~id3~0 != ~id8~0; 14078#L348 assume ~id4~0 != ~id5~0; 14061#L349 assume ~id4~0 != ~id6~0; 14062#L350 assume ~id4~0 != ~id7~0; 14047#L351 assume ~id4~0 != ~id8~0; 14048#L352 assume ~id5~0 != ~id6~0; 14067#L353 assume ~id5~0 != ~id7~0; 14031#L354 assume ~id5~0 != ~id8~0; 13999#L355 assume ~id6~0 != ~id7~0; 14000#L356 assume ~id6~0 != ~id8~0; 14028#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 13992#L297-1 init_#res#1 := init_~tmp~0#1; 13938#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 13939#L24 assume !(0 == assume_abort_if_not_~cond#1); 13949#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 13950#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 14278#L94 assume !(0 != ~mode1~0 % 256); 14276#L108 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 14274#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 14272#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 14266#L120 assume !(0 != ~mode2~0 % 256); 14262#L133 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 14261#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 14231#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 14227#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 14228#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 14219#L148-1 ~mode3~0 := 0; 14214#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 14211#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 14208#L173 [2022-02-21 04:31:27,263 INFO L793 eck$LassoCheckResult]: Loop: 14208#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 14205#L173-1 ~mode4~0 := 0; 14201#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 14200#L195 assume !(0 != ~mode5~0 % 256); 14195#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 14189#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 14186#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 14183#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 14178#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 14172#L223-1 ~mode6~0 := 0; 14169#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 14168#L245 assume !(0 != ~mode7~0 % 256); 14161#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 14153#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 14149#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 14146#L270 assume !(0 != ~mode8~0 % 256); 14138#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 14133#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 14134#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 14495#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 14493#L551 assume !(~r1~0 % 256 >= 8); 14122#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 14123#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 14382#L550-1 check_#res#1 := check_~tmp~1#1; 14380#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 14378#L670 assume !(0 == assert_~arg#1 % 256); 14376#L665 assume { :end_inline_assert } true; 14305#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 14259#L94 assume !(0 != ~mode1~0 % 256); 14256#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 14254#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 14252#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 14243#L120 assume !(0 != ~mode2~0 % 256); 14241#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 14239#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 14237#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 14236#L145 assume !(0 != ~mode3~0 % 256); 14222#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 14216#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 14213#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 14210#L170 assume !(0 != ~mode4~0 % 256); 14206#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 14203#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 14204#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 14608#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 14606#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 14603#L198-1 ~mode5~0 := 0; 14601#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 14600#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 14597#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 14594#L223-1 ~mode6~0 := 0; 14592#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 14591#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 14589#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 14586#L248-1 ~mode7~0 := 0; 14584#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 14583#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 14580#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 14576#L273-1 ~mode8~0 := 0; 14131#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 14128#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 14125#L551 assume !(~r1~0 % 256 >= 8); 14126#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 14119#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 14120#L550-1 check_#res#1 := check_~tmp~1#1; 14374#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 14371#L670 assume !(0 == assert_~arg#1 % 256); 14303#L665 assume { :end_inline_assert } true; 14301#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 14258#L94 assume !(0 != ~mode1~0 % 256); 14255#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 14253#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 14251#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 14247#L120 assume !(0 != ~mode2~0 % 256); 14245#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 14242#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 14240#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 14238#L145 assume !(0 != ~mode3~0 % 256); 14232#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 14220#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 14215#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 14212#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 14208#L173 [2022-02-21 04:31:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -546171204, now seen corresponding path program 1 times [2022-02-21 04:31:27,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:27,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164082859] [2022-02-21 04:31:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:27,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {16575#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {16575#true} is VALID [2022-02-21 04:31:27,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {16575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16575#true} is VALID [2022-02-21 04:31:27,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {16575#true} assume 0 == ~r1~0 % 256; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {16575#true} assume ~id1~0 >= 0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {16575#true} assume 0 == ~st1~0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {16575#true} assume ~send1~0 == ~id1~0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {16575#true} assume 0 == ~mode1~0 % 256; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {16575#true} assume ~id2~0 >= 0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {16575#true} assume 0 == ~st2~0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {16575#true} assume ~send2~0 == ~id2~0; {16575#true} is VALID [2022-02-21 04:31:27,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {16575#true} assume 0 == ~mode2~0 % 256; {16575#true} is VALID [2022-02-21 04:31:27,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {16575#true} assume ~id3~0 >= 0; {16575#true} is VALID [2022-02-21 04:31:27,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {16575#true} assume 0 == ~st3~0; {16575#true} is VALID [2022-02-21 04:31:27,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {16575#true} assume ~send3~0 == ~id3~0; {16575#true} is VALID [2022-02-21 04:31:27,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {16575#true} assume 0 == ~mode3~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,360 INFO L290 TraceCheckUtils]: 75: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-21 04:31:27,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {16577#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16576#false} is VALID [2022-02-21 04:31:27,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {16576#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16576#false} is VALID [2022-02-21 04:31:27,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {16576#false} ~mode3~0 := 0; {16576#false} is VALID [2022-02-21 04:31:27,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {16576#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16576#false} is VALID [2022-02-21 04:31:27,361 INFO L290 TraceCheckUtils]: 80: Hoare triple {16576#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16576#false} is VALID [2022-02-21 04:31:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:27,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:27,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164082859] [2022-02-21 04:31:27,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164082859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:27,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:27,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:27,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785061941] [2022-02-21 04:31:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:27,363 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -840124115, now seen corresponding path program 1 times [2022-02-21 04:31:27,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:27,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294996336] [2022-02-21 04:31:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:27,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {16578#true} assume !(node4_~m4~0#1 != ~nomsg~0); {16578#true} is VALID [2022-02-21 04:31:27,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {16578#true} ~mode4~0 := 0; {16578#true} is VALID [2022-02-21 04:31:27,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {16578#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16578#true} is VALID [2022-02-21 04:31:27,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {16578#true} assume !(0 != ~mode5~0 % 256); {16578#true} is VALID [2022-02-21 04:31:27,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {16578#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {16578#true} is VALID [2022-02-21 04:31:27,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {16578#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {16578#true} is VALID [2022-02-21 04:31:27,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {16578#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16578#true} is VALID [2022-02-21 04:31:27,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {16578#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16578#true} is VALID [2022-02-21 04:31:27,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {16578#true} assume !(node6_~m6~0#1 != ~nomsg~0); {16578#true} is VALID [2022-02-21 04:31:27,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {16578#true} ~mode6~0 := 0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode7~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode8~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(~r1~0 % 256 >= 8); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} check_#res#1 := check_~tmp~1#1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 == assert_~arg#1 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_assert } true; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode1~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode2~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode3~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(0 != ~mode4~0 % 256); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume !(node5_~m5~0#1 != ~nomsg~0); {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} ~mode5~0 := 0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} is VALID [2022-02-21 04:31:27,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {16580#(and (<= 0 ~mode6~0) (<= ~mode6~0 (* 256 (div ~mode6~0 256))))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {16579#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16579#false} is VALID [2022-02-21 04:31:27,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {16579#false} ~mode6~0 := 0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {16579#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {16579#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {16579#false} assume !(node7_~m7~0#1 != ~nomsg~0); {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {16579#false} ~mode7~0 := 0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {16579#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {16579#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {16579#false} assume !(node8_~m8~0#1 != ~nomsg~0); {16579#false} is VALID [2022-02-21 04:31:27,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {16579#false} ~mode8~0 := 0; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {16579#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {16579#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {16579#false} assume !(~r1~0 % 256 >= 8); {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {16579#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {16579#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {16579#false} check_#res#1 := check_~tmp~1#1; {16579#false} is VALID [2022-02-21 04:31:27,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {16579#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {16579#false} assume !(0 == assert_~arg#1 % 256); {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {16579#false} assume { :end_inline_assert } true; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {16579#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {16579#false} assume !(0 != ~mode1~0 % 256); {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {16579#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {16579#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {16579#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {16579#false} assume !(0 != ~mode2~0 % 256); {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {16579#false} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {16579#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {16579#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {16579#false} assume !(0 != ~mode3~0 % 256); {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {16579#false} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {16579#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {16579#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {16579#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16579#false} is VALID [2022-02-21 04:31:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:27,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:27,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294996336] [2022-02-21 04:31:27,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294996336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:27,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:27,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:27,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098125918] [2022-02-21 04:31:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:27,469 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:27,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:27,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:27,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:27,470 INFO L87 Difference]: Start difference. First operand 881 states and 1287 transitions. cyclomatic complexity: 407 Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:27,735 INFO L93 Difference]: Finished difference Result 1601 states and 2341 transitions. [2022-02-21 04:31:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:27,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:27,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:27,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1520 [2022-02-21 04:31:27,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1601 states to 1601 states and 2341 transitions. [2022-02-21 04:31:27,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1601 [2022-02-21 04:31:27,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1601 [2022-02-21 04:31:27,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:27,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:27,968 INFO L681 BuchiCegarLoop]: Abstraction has 1601 states and 2341 transitions. [2022-02-21 04:31:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2022-02-21 04:31:27,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:27,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1601 states and 2341 transitions. Second operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,996 INFO L74 IsIncluded]: Start isIncluded. First operand 1601 states and 2341 transitions. Second operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:27,997 INFO L87 Difference]: Start difference. First operand 1601 states and 2341 transitions. Second operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:28,059 INFO L93 Difference]: Finished difference Result 1601 states and 2341 transitions. [2022-02-21 04:31:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:28,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:28,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:28,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 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 1601 states and 2341 transitions. [2022-02-21 04:31:28,065 INFO L87 Difference]: Start difference. First operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 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 1601 states and 2341 transitions. [2022-02-21 04:31:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:28,171 INFO L93 Difference]: Finished difference Result 1601 states and 2341 transitions. [2022-02-21 04:31:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:28,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:28,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:28,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:28,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1601 states have (on average 1.462211118051218) internal successors, (2341), 1600 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2341 transitions. [2022-02-21 04:31:28,244 INFO L704 BuchiCegarLoop]: Abstraction has 1601 states and 2341 transitions. [2022-02-21 04:31:28,244 INFO L587 BuchiCegarLoop]: Abstraction has 1601 states and 2341 transitions. [2022-02-21 04:31:28,244 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:31:28,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1601 states and 2341 transitions. [2022-02-21 04:31:28,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1520 [2022-02-21 04:31:28,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:28,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:28,252 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, 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] [2022-02-21 04:31:28,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:28,253 INFO L791 eck$LassoCheckResult]: Stem: 18336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 18258#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 18243#L297 assume 0 == ~r1~0 % 256; 18233#L298 assume ~id1~0 >= 0; 18234#L299 assume 0 == ~st1~0; 18253#L300 assume ~send1~0 == ~id1~0; 18302#L301 assume 0 == ~mode1~0 % 256; 18317#L302 assume ~id2~0 >= 0; 18318#L303 assume 0 == ~st2~0; 18326#L304 assume ~send2~0 == ~id2~0; 18292#L305 assume 0 == ~mode2~0 % 256; 18293#L306 assume ~id3~0 >= 0; 18313#L307 assume 0 == ~st3~0; 18198#L308 assume ~send3~0 == ~id3~0; 18199#L309 assume 0 == ~mode3~0 % 256; 18308#L310 assume ~id4~0 >= 0; 18270#L311 assume 0 == ~st4~0; 18271#L312 assume ~send4~0 == ~id4~0; 18219#L313 assume 0 == ~mode4~0 % 256; 18220#L314 assume ~id5~0 >= 0; 18259#L315 assume 0 == ~st5~0; 18260#L316 assume ~send5~0 == ~id5~0; 18184#L317 assume 0 == ~mode5~0 % 256; 18185#L318 assume ~id6~0 >= 0; 18337#L319 assume 0 == ~st6~0; 18316#L320 assume ~send6~0 == ~id6~0; 18299#L321 assume 0 == ~mode6~0 % 256; 18300#L322 assume ~id7~0 >= 0; 18182#L323 assume 0 == ~st7~0; 18183#L324 assume ~send7~0 == ~id7~0; 18207#L325 assume 0 == ~mode7~0 % 256; 18224#L326 assume ~id8~0 >= 0; 18210#L327 assume 0 == ~st8~0; 18211#L328 assume ~send8~0 == ~id8~0; 18247#L329 assume 0 == ~mode8~0 % 256; 18248#L330 assume ~id1~0 != ~id2~0; 18196#L331 assume ~id1~0 != ~id3~0; 18197#L332 assume ~id1~0 != ~id4~0; 18223#L333 assume ~id1~0 != ~id5~0; 18244#L334 assume ~id1~0 != ~id6~0; 18217#L335 assume ~id1~0 != ~id7~0; 18218#L336 assume ~id1~0 != ~id8~0; 18312#L337 assume ~id2~0 != ~id3~0; 18278#L338 assume ~id2~0 != ~id4~0; 18279#L339 assume ~id2~0 != ~id5~0; 18329#L340 assume ~id2~0 != ~id6~0; 18322#L341 assume ~id2~0 != ~id7~0; 18249#L342 assume ~id2~0 != ~id8~0; 18250#L343 assume ~id3~0 != ~id4~0; 18235#L344 assume ~id3~0 != ~id5~0; 18236#L345 assume ~id3~0 != ~id6~0; 18263#L346 assume ~id3~0 != ~id7~0; 18264#L347 assume ~id3~0 != ~id8~0; 18333#L348 assume ~id4~0 != ~id5~0; 18319#L349 assume ~id4~0 != ~id6~0; 18320#L350 assume ~id4~0 != ~id7~0; 18305#L351 assume ~id4~0 != ~id8~0; 18306#L352 assume ~id5~0 != ~id6~0; 18325#L353 assume ~id5~0 != ~id7~0; 18286#L354 assume ~id5~0 != ~id8~0; 18251#L355 assume ~id6~0 != ~id7~0; 18252#L356 assume ~id6~0 != ~id8~0; 18283#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 18242#L297-1 init_#res#1 := init_~tmp~0#1; 18191#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 18192#L24 assume !(0 == assume_abort_if_not_~cond#1); 18202#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18203#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 18470#L94 assume !(0 != ~mode1~0 % 256); 18469#L108 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 18468#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 18467#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 18466#L120 assume !(0 != ~mode2~0 % 256); 18465#L133 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 18464#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 18463#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 18462#L145 assume !(0 != ~mode3~0 % 256); 18461#L158 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 18460#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 18459#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 18458#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 18454#L173 [2022-02-21 04:31:28,253 INFO L793 eck$LassoCheckResult]: Loop: 18454#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 18453#L173-1 ~mode4~0 := 0; 19038#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 19035#L195 assume !(0 != ~mode5~0 % 256); 19026#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 19022#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 19020#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 19015#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 19010#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 19004#L223-1 ~mode6~0 := 0; 19001#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 18999#L245 assume !(0 != ~mode7~0 % 256); 18991#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 18987#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 18985#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 18983#L270 assume !(0 != ~mode8~0 % 256); 18975#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 18971#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 18969#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 18966#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 18963#L551 assume !(~r1~0 % 256 >= 8); 18369#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 18370#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 18779#L550-1 check_#res#1 := check_~tmp~1#1; 18777#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 18775#L670 assume !(0 == assert_~arg#1 % 256); 18773#L665 assume { :end_inline_assert } true; 18769#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 18590#L94 assume !(0 != ~mode1~0 % 256); 18538#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 18517#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 18511#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 18505#L120 assume !(0 != ~mode2~0 % 256); 18498#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 18494#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 18488#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 18483#L145 assume !(0 != ~mode3~0 % 256); 18478#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 18475#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 18472#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 18473#L170 assume !(0 != ~mode4~0 % 256); 18450#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 18451#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 18916#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 18908#L195 assume !(0 != ~mode5~0 % 256); 18901#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 18897#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 18894#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 18888#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 18882#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 18873#L223-1 ~mode6~0 := 0; 18868#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 18864#L245 assume !(0 != ~mode7~0 % 256); 18860#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 18856#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 18852#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 18849#L270 assume !(0 != ~mode8~0 % 256); 18844#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 18841#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 18836#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 18833#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 18830#L551 assume !(~r1~0 % 256 >= 8); 18827#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 18824#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 18823#L550-1 check_#res#1 := check_~tmp~1#1; 18820#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 18624#L670 assume !(0 == assert_~arg#1 % 256); 18622#L665 assume { :end_inline_assert } true; 18620#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 18549#L94 assume !(0 != ~mode1~0 % 256); 18545#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 18543#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 18541#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 18522#L120 assume !(0 != ~mode2~0 % 256); 18513#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 18507#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 18500#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 18496#L145 assume !(0 != ~mode3~0 % 256); 18489#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 18484#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 18474#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 18471#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 18454#L173 [2022-02-21 04:31:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -527483598, now seen corresponding path program 1 times [2022-02-21 04:31:28,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:28,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106504343] [2022-02-21 04:31:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:28,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {22988#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {22988#true} is VALID [2022-02-21 04:31:28,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {22988#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {22988#true} assume 0 == ~r1~0 % 256; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {22988#true} assume ~id1~0 >= 0; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {22988#true} assume 0 == ~st1~0; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {22988#true} assume ~send1~0 == ~id1~0; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {22988#true} assume 0 == ~mode1~0 % 256; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {22988#true} assume ~id2~0 >= 0; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {22988#true} assume 0 == ~st2~0; {22988#true} is VALID [2022-02-21 04:31:28,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {22988#true} assume ~send2~0 == ~id2~0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {22988#true} assume 0 == ~mode2~0 % 256; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {22988#true} assume ~id3~0 >= 0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {22988#true} assume 0 == ~st3~0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {22988#true} assume ~send3~0 == ~id3~0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {22988#true} assume 0 == ~mode3~0 % 256; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {22988#true} assume ~id4~0 >= 0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {22988#true} assume 0 == ~st4~0; {22988#true} is VALID [2022-02-21 04:31:28,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {22988#true} assume ~send4~0 == ~id4~0; {22988#true} is VALID [2022-02-21 04:31:28,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {22988#true} assume 0 == ~mode4~0 % 256; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,318 INFO L290 TraceCheckUtils]: 77: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-21 04:31:28,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {22990#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22989#false} is VALID [2022-02-21 04:31:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:28,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:28,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106504343] [2022-02-21 04:31:28,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106504343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:28,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:28,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:31:28,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195575938] [2022-02-21 04:31:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:28,321 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1284588299, now seen corresponding path program 1 times [2022-02-21 04:31:28,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:28,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086967897] [2022-02-21 04:31:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:28,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {22991#true} assume !(node4_~m4~0#1 != ~nomsg~0); {22991#true} is VALID [2022-02-21 04:31:28,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {22991#true} ~mode4~0 := 0; {22991#true} is VALID [2022-02-21 04:31:28,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {22991#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22991#true} is VALID [2022-02-21 04:31:28,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {22991#true} assume !(0 != ~mode5~0 % 256); {22991#true} is VALID [2022-02-21 04:31:28,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {22991#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {22991#true} is VALID [2022-02-21 04:31:28,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {22991#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(node6_~m6~0#1 != ~nomsg~0); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~mode6~0 := 0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode7~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode8~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(~r1~0 % 256 >= 8); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} check_#res#1 := check_~tmp~1#1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 == assert_~arg#1 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_assert } true; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode1~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode2~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode3~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode4~0 % 256); {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} is VALID [2022-02-21 04:31:28,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {22993#(and (<= 1 ~mode5~0) (<= (div ~mode5~0 256) 0))} assume !(0 != ~mode5~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {22992#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {22992#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {22992#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {22992#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {22992#false} assume !(node6_~m6~0#1 != ~nomsg~0); {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {22992#false} ~mode6~0 := 0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {22992#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {22992#false} assume !(0 != ~mode7~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {22992#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {22992#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {22992#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {22992#false} assume !(0 != ~mode8~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {22992#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {22992#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {22992#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {22992#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {22992#false} assume !(~r1~0 % 256 >= 8); {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {22992#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {22992#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {22992#false} is VALID [2022-02-21 04:31:28,392 INFO L290 TraceCheckUtils]: 64: Hoare triple {22992#false} check_#res#1 := check_~tmp~1#1; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {22992#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {22992#false} assume !(0 == assert_~arg#1 % 256); {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {22992#false} assume { :end_inline_assert } true; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {22992#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {22992#false} assume !(0 != ~mode1~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {22992#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {22992#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {22992#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {22992#false} assume !(0 != ~mode2~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {22992#false} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 75: Hoare triple {22992#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {22992#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {22992#false} assume !(0 != ~mode3~0 % 256); {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {22992#false} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {22992#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {22992#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {22992#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22992#false} is VALID [2022-02-21 04:31:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:28,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:28,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086967897] [2022-02-21 04:31:28,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086967897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:28,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:28,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:28,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426160860] [2022-02-21 04:31:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:28,396 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:28,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:28,396 INFO L87 Difference]: Start difference. First operand 1601 states and 2341 transitions. cyclomatic complexity: 741 Second operand has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:28,687 INFO L93 Difference]: Finished difference Result 1601 states and 2340 transitions. [2022-02-21 04:31:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:28,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 40.5) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:28,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1601 states and 2340 transitions. [2022-02-21 04:31:28,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1520 [2022-02-21 04:31:28,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1601 states to 1601 states and 2340 transitions. [2022-02-21 04:31:28,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1601 [2022-02-21 04:31:28,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1601 [2022-02-21 04:31:28,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1601 states and 2340 transitions. [2022-02-21 04:31:28,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:28,955 INFO L681 BuchiCegarLoop]: Abstraction has 1601 states and 2340 transitions. [2022-02-21 04:31:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states and 2340 transitions. [2022-02-21 04:31:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1587. [2022-02-21 04:31:28,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:28,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1601 states and 2340 transitions. Second operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,972 INFO L74 IsIncluded]: Start isIncluded. First operand 1601 states and 2340 transitions. Second operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:28,973 INFO L87 Difference]: Start difference. First operand 1601 states and 2340 transitions. Second operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:29,039 INFO L93 Difference]: Finished difference Result 1601 states and 2340 transitions. [2022-02-21 04:31:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2340 transitions. [2022-02-21 04:31:29,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:29,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:29,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 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 1601 states and 2340 transitions. [2022-02-21 04:31:29,045 INFO L87 Difference]: Start difference. First operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 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 1601 states and 2340 transitions. [2022-02-21 04:31:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:29,137 INFO L93 Difference]: Finished difference Result 1601 states and 2340 transitions. [2022-02-21 04:31:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2340 transitions. [2022-02-21 04:31:29,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:29,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:29,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1587 states have (on average 1.463768115942029) internal successors, (2323), 1586 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2323 transitions. [2022-02-21 04:31:29,211 INFO L704 BuchiCegarLoop]: Abstraction has 1587 states and 2323 transitions. [2022-02-21 04:31:29,211 INFO L587 BuchiCegarLoop]: Abstraction has 1587 states and 2323 transitions. [2022-02-21 04:31:29,211 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 04:31:29,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1587 states and 2323 transitions. [2022-02-21 04:31:29,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1520 [2022-02-21 04:31:29,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:29,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:29,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:29,217 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:29,217 INFO L791 eck$LassoCheckResult]: Stem: 24744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 24670#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 24658#L297 assume 0 == ~r1~0 % 256; 24647#L298 assume ~id1~0 >= 0; 24648#L299 assume 0 == ~st1~0; 24666#L300 assume ~send1~0 == ~id1~0; 24712#L301 assume 0 == ~mode1~0 % 256; 24725#L302 assume ~id2~0 >= 0; 24726#L303 assume 0 == ~st2~0; 24734#L304 assume ~send2~0 == ~id2~0; 24703#L305 assume 0 == ~mode2~0 % 256; 24704#L306 assume ~id3~0 >= 0; 24721#L307 assume 0 == ~st3~0; 24611#L308 assume ~send3~0 == ~id3~0; 24612#L309 assume 0 == ~mode3~0 % 256; 24717#L310 assume ~id4~0 >= 0; 24683#L311 assume 0 == ~st4~0; 24684#L312 assume ~send4~0 == ~id4~0; 24632#L313 assume 0 == ~mode4~0 % 256; 24633#L314 assume ~id5~0 >= 0; 24671#L315 assume 0 == ~st5~0; 24672#L316 assume ~send5~0 == ~id5~0; 24597#L317 assume 0 == ~mode5~0 % 256; 24598#L318 assume ~id6~0 >= 0; 24745#L319 assume 0 == ~st6~0; 24724#L320 assume ~send6~0 == ~id6~0; 24709#L321 assume 0 == ~mode6~0 % 256; 24710#L322 assume ~id7~0 >= 0; 24595#L323 assume 0 == ~st7~0; 24596#L324 assume ~send7~0 == ~id7~0; 24620#L325 assume 0 == ~mode7~0 % 256; 24637#L326 assume ~id8~0 >= 0; 24623#L327 assume 0 == ~st8~0; 24624#L328 assume ~send8~0 == ~id8~0; 24660#L329 assume 0 == ~mode8~0 % 256; 24661#L330 assume ~id1~0 != ~id2~0; 24609#L331 assume ~id1~0 != ~id3~0; 24610#L332 assume ~id1~0 != ~id4~0; 24636#L333 assume ~id1~0 != ~id5~0; 24659#L334 assume ~id1~0 != ~id6~0; 24630#L335 assume ~id1~0 != ~id7~0; 24631#L336 assume ~id1~0 != ~id8~0; 24720#L337 assume ~id2~0 != ~id3~0; 24690#L338 assume ~id2~0 != ~id4~0; 24691#L339 assume ~id2~0 != ~id5~0; 24737#L340 assume ~id2~0 != ~id6~0; 24730#L341 assume ~id2~0 != ~id7~0; 24662#L342 assume ~id2~0 != ~id8~0; 24663#L343 assume ~id3~0 != ~id4~0; 24649#L344 assume ~id3~0 != ~id5~0; 24650#L345 assume ~id3~0 != ~id6~0; 24675#L346 assume ~id3~0 != ~id7~0; 24676#L347 assume ~id3~0 != ~id8~0; 24741#L348 assume ~id4~0 != ~id5~0; 24727#L349 assume ~id4~0 != ~id6~0; 24728#L350 assume ~id4~0 != ~id7~0; 24714#L351 assume ~id4~0 != ~id8~0; 24715#L352 assume ~id5~0 != ~id6~0; 24732#L353 assume ~id5~0 != ~id7~0; 24698#L354 assume ~id5~0 != ~id8~0; 24664#L355 assume ~id6~0 != ~id7~0; 24665#L356 assume ~id6~0 != ~id8~0; 24695#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 24656#L297-1 init_#res#1 := init_~tmp~0#1; 24604#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 24605#L24 assume !(0 == assume_abort_if_not_~cond#1); 24615#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 24616#L632-2 [2022-02-21 04:31:29,217 INFO L793 eck$LassoCheckResult]: Loop: 24616#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 24743#L94 assume !(0 != ~mode1~0 % 256); 24625#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 24626#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 24731#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 24679#L120 assume !(0 != ~mode2~0 % 256); 24680#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 24634#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 24635#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 24646#L145 assume !(0 != ~mode3~0 % 256); 24619#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 24613#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 24614#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 24692#L170 assume !(0 != ~mode4~0 % 256); 24858#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 24859#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 25261#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 25256#L195 assume !(0 != ~mode5~0 % 256); 25250#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 25247#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 25245#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 25240#L220 assume !(0 != ~mode6~0 % 256); 25234#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 25231#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 25229#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 25224#L245 assume !(0 != ~mode7~0 % 256); 25218#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 25215#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 25213#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 25210#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 25209#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 25206#L273-1 ~mode8~0 := 0; 25204#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 25201#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 25199#L551 assume ~r1~0 % 256 >= 8; 25200#L555 assume !(~r1~0 % 256 < 8); 25015#L559 assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0;check_~tmp~1#1 := 1; 25818#L550-1 check_#res#1 := check_~tmp~1#1; 25815#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 25811#L670 assume !(0 == assert_~arg#1 % 256); 25804#L665 assume { :end_inline_assert } true; 25799#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 25794#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 24910#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 25780#L98-1 ~mode1~0 := 0; 25778#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 25768#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 25769#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 26169#L123-1 ~mode2~0 := 0; 26168#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 26167#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 26137#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 26133#L148-1 ~mode3~0 := 0; 26131#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 26128#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 24696#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 24694#L173-1 ~mode4~0 := 0; 24742#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 26113#L195 assume !(0 != ~mode5~0 % 256); 26114#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 26104#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 26103#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 26100#L220 assume !(0 != ~mode6~0 % 256); 26099#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 26097#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 26093#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 26090#L245 assume !(0 != ~mode7~0 % 256); 26080#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 26076#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 26074#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 26069#L270 assume !(0 != ~mode8~0 % 256); 24733#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 24617#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 24618#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 24708#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 24651#L551 assume !(~r1~0 % 256 >= 8); 24653#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 24746#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 24681#L550-1 check_#res#1 := check_~tmp~1#1; 24668#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 24669#L670 assume !(0 == assert_~arg#1 % 256); 24682#L665 assume { :end_inline_assert } true; 24616#L632-2 [2022-02-21 04:31:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 7 times [2022-02-21 04:31:29,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:29,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900697793] [2022-02-21 04:31:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:29,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:29,252 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1130739842, now seen corresponding path program 1 times [2022-02-21 04:31:29,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:29,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806686328] [2022-02-21 04:31:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {29389#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {29389#true} assume !(0 != ~mode1~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {29389#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {29389#true} is VALID [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {29389#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {29389#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {29389#true} assume !(0 != ~mode2~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {29389#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {29389#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {29389#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {29389#true} assume !(0 != ~mode3~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {29389#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {29389#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {29389#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {29389#true} assume !(0 != ~mode4~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {29389#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {29389#true} is VALID [2022-02-21 04:31:29,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {29389#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {29389#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {29389#true} assume !(0 != ~mode5~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {29389#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {29389#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {29389#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {29389#true} assume !(0 != ~mode6~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {29389#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {29389#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {29389#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {29389#true} assume !(0 != ~mode7~0 % 256); {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {29389#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {29389#true} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {29389#true} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {29389#true} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {29389#true} assume !(node8_~m8~0#1 != ~nomsg~0); {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {29389#true} ~mode8~0 := 0; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {29389#true} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {29389#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {29389#true} assume ~r1~0 % 256 >= 8; {29389#true} is VALID [2022-02-21 04:31:29,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {29389#true} assume !(~r1~0 % 256 < 8); {29389#true} is VALID [2022-02-21 04:31:29,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {29389#true} assume 1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0;check_~tmp~1#1 := 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} check_#res#1 := check_~tmp~1#1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(0 == assert_~arg#1 % 256); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_assert } true; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~mode1~0 := 0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~mode2~0 := 0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(node3_~m3~0#1 != ~nomsg~0); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~mode3~0 := 0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(node4_~m4~0#1 != ~nomsg~0); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~mode4~0 := 0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(0 != ~mode5~0 % 256); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(0 != ~mode6~0 % 256); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(0 != ~mode7~0 % 256); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(0 != ~mode8~0 % 256); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,327 INFO L290 TraceCheckUtils]: 71: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,328 INFO L290 TraceCheckUtils]: 72: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,328 INFO L290 TraceCheckUtils]: 74: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume !(~r1~0 % 256 >= 8); {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {29391#(<= 1 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {29390#false} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {29390#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {29390#false} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {29390#false} check_#res#1 := check_~tmp~1#1; {29390#false} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 79: Hoare triple {29390#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29390#false} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {29390#false} assume !(0 == assert_~arg#1 % 256); {29390#false} is VALID [2022-02-21 04:31:29,329 INFO L290 TraceCheckUtils]: 81: Hoare triple {29390#false} assume { :end_inline_assert } true; {29390#false} is VALID [2022-02-21 04:31:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:29,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:29,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806686328] [2022-02-21 04:31:29,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806686328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:29,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:29,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:29,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336613486] [2022-02-21 04:31:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:29,330 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:29,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:29,331 INFO L87 Difference]: Start difference. First operand 1587 states and 2323 transitions. cyclomatic complexity: 737 Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:29,639 INFO L93 Difference]: Finished difference Result 2389 states and 3542 transitions. [2022-02-21 04:31:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:29,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:29,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:29,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2389 states and 3542 transitions. [2022-02-21 04:31:29,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2314 [2022-02-21 04:31:29,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2389 states to 2381 states and 3534 transitions. [2022-02-21 04:31:29,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2381 [2022-02-21 04:31:29,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2381 [2022-02-21 04:31:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2381 states and 3534 transitions. [2022-02-21 04:31:29,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:29,992 INFO L681 BuchiCegarLoop]: Abstraction has 2381 states and 3534 transitions. [2022-02-21 04:31:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states and 3534 transitions. [2022-02-21 04:31:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2019. [2022-02-21 04:31:30,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:30,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2381 states and 3534 transitions. Second operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:30,067 INFO L74 IsIncluded]: Start isIncluded. First operand 2381 states and 3534 transitions. Second operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:30,069 INFO L87 Difference]: Start difference. First operand 2381 states and 3534 transitions. Second operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:30,270 INFO L93 Difference]: Finished difference Result 2381 states and 3534 transitions. [2022-02-21 04:31:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3534 transitions. [2022-02-21 04:31:30,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:30,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:30,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 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 2381 states and 3534 transitions. [2022-02-21 04:31:30,280 INFO L87 Difference]: Start difference. First operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 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 2381 states and 3534 transitions. [2022-02-21 04:31:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:30,483 INFO L93 Difference]: Finished difference Result 2381 states and 3534 transitions. [2022-02-21 04:31:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3534 transitions. [2022-02-21 04:31:30,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:30,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:30,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:30,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2019 states have (on average 1.4834076275383854) internal successors, (2995), 2018 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2995 transitions. [2022-02-21 04:31:30,636 INFO L704 BuchiCegarLoop]: Abstraction has 2019 states and 2995 transitions. [2022-02-21 04:31:30,636 INFO L587 BuchiCegarLoop]: Abstraction has 2019 states and 2995 transitions. [2022-02-21 04:31:30,636 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 04:31:30,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2019 states and 2995 transitions. [2022-02-21 04:31:30,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1952 [2022-02-21 04:31:30,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:30,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:30,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:30,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:30,652 INFO L791 eck$LassoCheckResult]: Stem: 31934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 31856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 31843#L297 assume 0 == ~r1~0 % 256; 31832#L298 assume ~id1~0 >= 0; 31833#L299 assume 0 == ~st1~0; 31852#L300 assume ~send1~0 == ~id1~0; 31902#L301 assume 0 == ~mode1~0 % 256; 31914#L302 assume ~id2~0 >= 0; 31915#L303 assume 0 == ~st2~0; 31924#L304 assume ~send2~0 == ~id2~0; 31893#L305 assume 0 == ~mode2~0 % 256; 31894#L306 assume ~id3~0 >= 0; 31910#L307 assume 0 == ~st3~0; 31797#L308 assume ~send3~0 == ~id3~0; 31798#L309 assume 0 == ~mode3~0 % 256; 31906#L310 assume ~id4~0 >= 0; 31871#L311 assume 0 == ~st4~0; 31872#L312 assume ~send4~0 == ~id4~0; 31818#L313 assume 0 == ~mode4~0 % 256; 31819#L314 assume ~id5~0 >= 0; 31857#L315 assume 0 == ~st5~0; 31858#L316 assume ~send5~0 == ~id5~0; 31783#L317 assume 0 == ~mode5~0 % 256; 31784#L318 assume ~id6~0 >= 0; 31935#L319 assume 0 == ~st6~0; 31913#L320 assume ~send6~0 == ~id6~0; 31899#L321 assume 0 == ~mode6~0 % 256; 31900#L322 assume ~id7~0 >= 0; 31781#L323 assume 0 == ~st7~0; 31782#L324 assume ~send7~0 == ~id7~0; 31806#L325 assume 0 == ~mode7~0 % 256; 31823#L326 assume ~id8~0 >= 0; 31809#L327 assume 0 == ~st8~0; 31810#L328 assume ~send8~0 == ~id8~0; 31846#L329 assume 0 == ~mode8~0 % 256; 31847#L330 assume ~id1~0 != ~id2~0; 31795#L331 assume ~id1~0 != ~id3~0; 31796#L332 assume ~id1~0 != ~id4~0; 31822#L333 assume ~id1~0 != ~id5~0; 31844#L334 assume ~id1~0 != ~id6~0; 31816#L335 assume ~id1~0 != ~id7~0; 31817#L336 assume ~id1~0 != ~id8~0; 31909#L337 assume ~id2~0 != ~id3~0; 31878#L338 assume ~id2~0 != ~id4~0; 31879#L339 assume ~id2~0 != ~id5~0; 31927#L340 assume ~id2~0 != ~id6~0; 31919#L341 assume ~id2~0 != ~id7~0; 31848#L342 assume ~id2~0 != ~id8~0; 31849#L343 assume ~id3~0 != ~id4~0; 31834#L344 assume ~id3~0 != ~id5~0; 31835#L345 assume ~id3~0 != ~id6~0; 31861#L346 assume ~id3~0 != ~id7~0; 31862#L347 assume ~id3~0 != ~id8~0; 31930#L348 assume ~id4~0 != ~id5~0; 31916#L349 assume ~id4~0 != ~id6~0; 31917#L350 assume ~id4~0 != ~id7~0; 31903#L351 assume ~id4~0 != ~id8~0; 31904#L352 assume ~id5~0 != ~id6~0; 31923#L353 assume ~id5~0 != ~id7~0; 31887#L354 assume ~id5~0 != ~id8~0; 31850#L355 assume ~id6~0 != ~id7~0; 31851#L356 assume ~id6~0 != ~id8~0; 31884#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 31842#L297-1 init_#res#1 := init_~tmp~0#1; 31790#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 31791#L24 assume !(0 == assume_abort_if_not_~cond#1); 31801#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 31802#L632-2 [2022-02-21 04:31:30,653 INFO L793 eck$LassoCheckResult]: Loop: 31802#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 33399#L94 assume !(0 != ~mode1~0 % 256); 33341#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 33398#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 33397#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 33393#L120 assume !(0 != ~mode2~0 % 256); 32639#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 33388#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 33383#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 32538#L145 assume !(0 != ~mode3~0 % 256); 32537#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 32536#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 32535#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 32534#L170 assume !(0 != ~mode4~0 % 256); 32533#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 32530#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 32374#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 32370#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 32368#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 32364#L198-1 ~mode5~0 := 0; 32356#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 32353#L220 assume !(0 != ~mode6~0 % 256); 32348#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 32345#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 32342#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 32339#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 32336#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 32332#L248-1 ~mode7~0 := 0; 32329#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 32326#L270 assume !(0 != ~mode8~0 % 256); 32320#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 32307#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 32305#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 32304#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 32302#L551 assume !(~r1~0 % 256 >= 8); 32300#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 32297#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 32295#L550-1 check_#res#1 := check_~tmp~1#1; 32293#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 32291#L670 assume !(0 == assert_~arg#1 % 256); 32282#L665 assume { :end_inline_assert } true; 32276#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 32269#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 32270#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 32896#L98-1 ~mode1~0 := 0; 33232#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 33229#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 33230#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 33293#L123-1 ~mode2~0 := 0; 33287#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 33282#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 33273#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 33269#L148-1 ~mode3~0 := 0; 33268#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 33267#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 32051#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 32046#L173-1 ~mode4~0 := 0; 32040#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 32037#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 32035#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 32019#L198-1 ~mode5~0 := 0; 32016#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 32013#L220 assume !(0 != ~mode6~0 % 256); 32010#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 32002#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 31997#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 31995#L245 assume !(0 != ~mode7~0 % 256); 31994#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 31992#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 31991#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 31990#L270 assume !(0 != ~mode8~0 % 256); 31984#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 31982#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 31981#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 31980#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 31979#L551 assume !(~r1~0 % 256 >= 8); 31978#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 31974#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 31975#L550-1 check_#res#1 := check_~tmp~1#1; 33402#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 33401#L670 assume !(0 == assert_~arg#1 % 256); 33400#L665 assume { :end_inline_assert } true; 31802#L632-2 [2022-02-21 04:31:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 8 times [2022-02-21 04:31:30,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:30,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569854053] [2022-02-21 04:31:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:30,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:30,686 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 173306463, now seen corresponding path program 1 times [2022-02-21 04:31:30,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:30,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452581391] [2022-02-21 04:31:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {38567#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {38567#true} assume !(0 != ~mode1~0 % 256); {38567#true} is VALID [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {38567#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {38567#true} is VALID [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {38567#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {38567#true} is VALID [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {38567#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {38567#true} assume !(0 != ~mode2~0 % 256); {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {38567#true} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {38567#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {38567#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {38567#true} assume !(0 != ~mode3~0 % 256); {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {38567#true} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {38567#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {38567#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {38567#true} assume !(0 != ~mode4~0 % 256); {38567#true} is VALID [2022-02-21 04:31:30,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {38567#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {38567#true} is VALID [2022-02-21 04:31:30,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {38567#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {38567#true} is VALID [2022-02-21 04:31:30,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {38567#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {38567#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38567#true} is VALID [2022-02-21 04:31:30,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {38567#true} assume !(node5_~m5~0#1 != ~nomsg~0); {38567#true} is VALID [2022-02-21 04:31:30,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {38567#true} ~mode5~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode6~0 % 256); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node7_~m7~0#1 != ~nomsg~0); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode7~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 != ~mode8~0 % 256); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(~r1~0 % 256 >= 8); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} check_#res#1 := check_~tmp~1#1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(0 == assert_~arg#1 % 256); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_assert } true; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node1_~m1~0#1 != ~nomsg~0); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode1~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,762 INFO L290 TraceCheckUtils]: 47: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node2_~m2~0#1 != ~nomsg~0); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode2~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node3_~m3~0#1 != ~nomsg~0); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode3~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume !(node4_~m4~0#1 != ~nomsg~0); {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} ~mode4~0 := 0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {38569#(and (<= ~mode5~0 (* 256 (div ~mode5~0 256))) (<= 0 ~mode5~0))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38568#false} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {38568#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38568#false} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {38568#false} ~mode5~0 := 0; {38568#false} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {38568#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38568#false} is VALID [2022-02-21 04:31:30,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {38568#false} assume !(0 != ~mode6~0 % 256); {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {38568#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {38568#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {38568#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {38568#false} assume !(0 != ~mode7~0 % 256); {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {38568#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {38568#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {38568#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {38568#false} assume !(0 != ~mode8~0 % 256); {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 71: Hoare triple {38568#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {38568#false} is VALID [2022-02-21 04:31:30,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {38568#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {38568#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {38568#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 75: Hoare triple {38568#false} assume !(~r1~0 % 256 >= 8); {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {38568#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {38568#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {38568#false} check_#res#1 := check_~tmp~1#1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {38568#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 80: Hoare triple {38568#false} assume !(0 == assert_~arg#1 % 256); {38568#false} is VALID [2022-02-21 04:31:30,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {38568#false} assume { :end_inline_assert } true; {38568#false} is VALID [2022-02-21 04:31:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:30,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:30,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452581391] [2022-02-21 04:31:30,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452581391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:30,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:30,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:30,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520904927] [2022-02-21 04:31:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:30,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:30,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:30,771 INFO L87 Difference]: Start difference. First operand 2019 states and 2995 transitions. cyclomatic complexity: 977 Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:31,370 INFO L93 Difference]: Finished difference Result 3843 states and 5667 transitions. [2022-02-21 04:31:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:31,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:31,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:31,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3843 states and 5667 transitions. [2022-02-21 04:31:31,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3776 [2022-02-21 04:31:32,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3843 states to 3843 states and 5667 transitions. [2022-02-21 04:31:32,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3843 [2022-02-21 04:31:32,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3843 [2022-02-21 04:31:32,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3843 states and 5667 transitions. [2022-02-21 04:31:32,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:32,386 INFO L681 BuchiCegarLoop]: Abstraction has 3843 states and 5667 transitions. [2022-02-21 04:31:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states and 5667 transitions. [2022-02-21 04:31:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3779. [2022-02-21 04:31:32,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:32,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3843 states and 5667 transitions. Second operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:32,441 INFO L74 IsIncluded]: Start isIncluded. First operand 3843 states and 5667 transitions. Second operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:32,445 INFO L87 Difference]: Start difference. First operand 3843 states and 5667 transitions. Second operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:32,965 INFO L93 Difference]: Finished difference Result 3843 states and 5667 transitions. [2022-02-21 04:31:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5667 transitions. [2022-02-21 04:31:32,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:32,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 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 3843 states and 5667 transitions. [2022-02-21 04:31:32,983 INFO L87 Difference]: Start difference. First operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 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 3843 states and 5667 transitions. [2022-02-21 04:31:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,371 INFO L93 Difference]: Finished difference Result 3843 states and 5667 transitions. [2022-02-21 04:31:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5667 transitions. [2022-02-21 04:31:33,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:33,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:33,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:33,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3779 states have (on average 1.4741995236835141) internal successors, (5571), 3778 states have internal predecessors, (5571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5571 transitions. [2022-02-21 04:31:33,730 INFO L704 BuchiCegarLoop]: Abstraction has 3779 states and 5571 transitions. [2022-02-21 04:31:33,730 INFO L587 BuchiCegarLoop]: Abstraction has 3779 states and 5571 transitions. [2022-02-21 04:31:33,730 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 04:31:33,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3779 states and 5571 transitions. [2022-02-21 04:31:33,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3712 [2022-02-21 04:31:33,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:33,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:33,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:33,740 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-02-21 04:31:33,740 INFO L791 eck$LassoCheckResult]: Stem: 42577#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 42490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 42477#L297 assume 0 == ~r1~0 % 256; 42466#L298 assume ~id1~0 >= 0; 42467#L299 assume 0 == ~st1~0; 42487#L300 assume ~send1~0 == ~id1~0; 42536#L301 assume 0 == ~mode1~0 % 256; 42550#L302 assume ~id2~0 >= 0; 42551#L303 assume 0 == ~st2~0; 42563#L304 assume ~send2~0 == ~id2~0; 42524#L305 assume 0 == ~mode2~0 % 256; 42525#L306 assume ~id3~0 >= 0; 42546#L307 assume 0 == ~st3~0; 42429#L308 assume ~send3~0 == ~id3~0; 42430#L309 assume 0 == ~mode3~0 % 256; 42542#L310 assume ~id4~0 >= 0; 42504#L311 assume 0 == ~st4~0; 42505#L312 assume ~send4~0 == ~id4~0; 42451#L313 assume 0 == ~mode4~0 % 256; 42452#L314 assume ~id5~0 >= 0; 42493#L315 assume 0 == ~st5~0; 42494#L316 assume ~send5~0 == ~id5~0; 42417#L317 assume 0 == ~mode5~0 % 256; 42418#L318 assume ~id6~0 >= 0; 42578#L319 assume 0 == ~st6~0; 42549#L320 assume ~send6~0 == ~id6~0; 42532#L321 assume 0 == ~mode6~0 % 256; 42533#L322 assume ~id7~0 >= 0; 42413#L323 assume 0 == ~st7~0; 42414#L324 assume ~send7~0 == ~id7~0; 42441#L325 assume 0 == ~mode7~0 % 256; 42459#L326 assume ~id8~0 >= 0; 42442#L327 assume 0 == ~st8~0; 42443#L328 assume ~send8~0 == ~id8~0; 42479#L329 assume 0 == ~mode8~0 % 256; 42480#L330 assume ~id1~0 != ~id2~0; 42427#L331 assume ~id1~0 != ~id3~0; 42428#L332 assume ~id1~0 != ~id4~0; 42455#L333 assume ~id1~0 != ~id5~0; 42478#L334 assume ~id1~0 != ~id6~0; 42449#L335 assume ~id1~0 != ~id7~0; 42450#L336 assume ~id1~0 != ~id8~0; 42545#L337 assume ~id2~0 != ~id3~0; 42510#L338 assume ~id2~0 != ~id4~0; 42511#L339 assume ~id2~0 != ~id5~0; 42566#L340 assume ~id2~0 != ~id6~0; 42555#L341 assume ~id2~0 != ~id7~0; 42481#L342 assume ~id2~0 != ~id8~0; 42482#L343 assume ~id3~0 != ~id4~0; 42468#L344 assume ~id3~0 != ~id5~0; 42469#L345 assume ~id3~0 != ~id6~0; 42495#L346 assume ~id3~0 != ~id7~0; 42496#L347 assume ~id3~0 != ~id8~0; 42572#L348 assume ~id4~0 != ~id5~0; 42552#L349 assume ~id4~0 != ~id6~0; 42553#L350 assume ~id4~0 != ~id7~0; 42539#L351 assume ~id4~0 != ~id8~0; 42540#L352 assume ~id5~0 != ~id6~0; 42560#L353 assume ~id5~0 != ~id7~0; 42518#L354 assume ~id5~0 != ~id8~0; 42483#L355 assume ~id6~0 != ~id7~0; 42484#L356 assume ~id6~0 != ~id8~0; 42515#L357 assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; 42474#L297-1 init_#res#1 := init_~tmp~0#1; 42422#L542 main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 42423#L24 assume !(0 == assume_abort_if_not_~cond#1); 42433#L23 assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 42434#L632-2 [2022-02-21 04:31:33,740 INFO L793 eck$LassoCheckResult]: Loop: 42434#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 42763#L94 assume !(0 != ~mode1~0 % 256); 42747#L108 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 42737#L108-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 42731#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 42723#L120 assume !(0 != ~mode2~0 % 256); 42719#L133 assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; 42715#L133-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 42709#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 42704#L145 assume !(0 != ~mode3~0 % 256); 42700#L158 assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; 42697#L158-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 42694#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 42695#L170 assume !(0 != ~mode4~0 % 256); 42684#L183 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 42685#L183-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 43322#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 43319#L195 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 43308#L198 assume !(node5_~m5~0#1 != ~nomsg~0); 43298#L198-1 ~mode5~0 := 0; 43291#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 43288#L220 assume !(0 != ~mode6~0 % 256); 43282#L233 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 43276#L233-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 43275#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 43274#L245 assume !(0 != ~mode7~0 % 256); 43270#L258 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 43245#L258-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 43243#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 43241#L270 assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 43234#L273 assume !(node8_~m8~0#1 != ~nomsg~0); 43228#L273-1 ~mode8~0 := 0; 43225#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 43223#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 43219#L551 assume !(~r1~0 % 256 >= 8); 43217#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 43213#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 43211#L550-1 check_#res#1 := check_~tmp~1#1; 43209#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 43207#L670 assume !(0 == assert_~arg#1 % 256); 43205#L665 assume { :end_inline_assert } true; 43203#L632-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 43200#L94 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 43201#L98 assume !(node1_~m1~0#1 != ~nomsg~0); 43969#L98-1 ~mode1~0 := 0; 43966#L94-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 43481#L120 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 43482#L123 assume !(node2_~m2~0#1 != ~nomsg~0); 45733#L123-1 ~mode2~0 := 0; 45732#L120-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 45731#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 45716#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 45705#L148-1 ~mode3~0 := 0; 45701#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 45598#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 45599#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 44413#L173-1 ~mode4~0 := 0; 44414#L170-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 44410#L195 assume !(0 != ~mode5~0 % 256); 44409#L208 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 43920#L208-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 43919#L195-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 43917#L220 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 43916#L223 assume !(node6_~m6~0#1 != ~nomsg~0); 43892#L223-1 ~mode6~0 := 0; 43870#L220-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 43866#L245 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 43864#L248 assume !(node7_~m7~0#1 != ~nomsg~0); 43857#L248-1 ~mode7~0 := 0; 43854#L245-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; 43852#L270 assume !(0 != ~mode8~0 % 256); 43833#L283 assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; 43825#L283-2 ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; 43822#L270-2 assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 43820#L550 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 43817#L551 assume !(~r1~0 % 256 >= 8); 43814#L554 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 43811#L555 assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; 43808#L550-1 check_#res#1 := check_~tmp~1#1; 43806#L570 main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 43804#L670 assume !(0 == assert_~arg#1 % 256); 43802#L665 assume { :end_inline_assert } true; 42434#L632-2 [2022-02-21 04:31:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 354076320, now seen corresponding path program 9 times [2022-02-21 04:31:33,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:33,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883192152] [2022-02-21 04:31:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:33,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:33,808 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1736409451, now seen corresponding path program 1 times [2022-02-21 04:31:33,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:33,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427888180] [2022-02-21 04:31:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:33,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:33,848 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1534198644, now seen corresponding path program 1 times [2022-02-21 04:31:33,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:33,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041572151] [2022-02-21 04:31:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:33,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {53885#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {53885#true} is VALID [2022-02-21 04:31:33,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {53885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {53885#true} assume 0 == ~r1~0 % 256; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {53885#true} assume ~id1~0 >= 0; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {53885#true} assume 0 == ~st1~0; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {53885#true} assume ~send1~0 == ~id1~0; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {53885#true} assume 0 == ~mode1~0 % 256; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {53885#true} assume ~id2~0 >= 0; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {53885#true} assume 0 == ~st2~0; {53885#true} is VALID [2022-02-21 04:31:33,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {53885#true} assume ~send2~0 == ~id2~0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {53885#true} assume 0 == ~mode2~0 % 256; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {53885#true} assume ~id3~0 >= 0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {53885#true} assume 0 == ~st3~0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {53885#true} assume ~send3~0 == ~id3~0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {53885#true} assume 0 == ~mode3~0 % 256; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {53885#true} assume ~id4~0 >= 0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {53885#true} assume 0 == ~st4~0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {53885#true} assume ~send4~0 == ~id4~0; {53885#true} is VALID [2022-02-21 04:31:33,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {53885#true} assume 0 == ~mode4~0 % 256; {53885#true} is VALID [2022-02-21 04:31:33,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {53885#true} assume ~id5~0 >= 0; {53885#true} is VALID [2022-02-21 04:31:33,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {53885#true} assume 0 == ~st5~0; {53885#true} is VALID [2022-02-21 04:31:33,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {53885#true} assume ~send5~0 == ~id5~0; {53885#true} is VALID [2022-02-21 04:31:33,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {53885#true} assume 0 == ~mode5~0 % 256; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,921 INFO L290 TraceCheckUtils]: 68: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,924 INFO L290 TraceCheckUtils]: 74: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,925 INFO L290 TraceCheckUtils]: 78: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 84: Hoare triple {53887#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {53886#false} assume !(node5_~m5~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {53886#false} ~mode5~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {53886#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {53886#false} assume !(0 != ~mode6~0 % 256); {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {53886#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {53886#false} is VALID [2022-02-21 04:31:33,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {53886#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {53886#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {53886#false} assume !(0 != ~mode7~0 % 256); {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {53886#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {53886#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 95: Hoare triple {53886#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 96: Hoare triple {53886#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 97: Hoare triple {53886#false} assume !(node8_~m8~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,929 INFO L290 TraceCheckUtils]: 98: Hoare triple {53886#false} ~mode8~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {53886#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {53886#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {53886#false} assume !(~r1~0 % 256 >= 8); {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 102: Hoare triple {53886#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 103: Hoare triple {53886#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 104: Hoare triple {53886#false} check_#res#1 := check_~tmp~1#1; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {53886#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {53886#false} is VALID [2022-02-21 04:31:33,930 INFO L290 TraceCheckUtils]: 106: Hoare triple {53886#false} assume !(0 == assert_~arg#1 % 256); {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {53886#false} assume { :end_inline_assert } true; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {53886#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 109: Hoare triple {53886#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {53886#false} assume !(node1_~m1~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {53886#false} ~mode1~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {53886#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 113: Hoare triple {53886#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,931 INFO L290 TraceCheckUtils]: 114: Hoare triple {53886#false} assume !(node2_~m2~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {53886#false} ~mode2~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 116: Hoare triple {53886#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 117: Hoare triple {53886#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 118: Hoare triple {53886#false} assume !(node3_~m3~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 119: Hoare triple {53886#false} ~mode3~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 120: Hoare triple {53886#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 121: Hoare triple {53886#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,932 INFO L290 TraceCheckUtils]: 122: Hoare triple {53886#false} assume !(node4_~m4~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 123: Hoare triple {53886#false} ~mode4~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 124: Hoare triple {53886#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 125: Hoare triple {53886#false} assume !(0 != ~mode5~0 % 256); {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 126: Hoare triple {53886#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 127: Hoare triple {53886#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 128: Hoare triple {53886#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 129: Hoare triple {53886#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,933 INFO L290 TraceCheckUtils]: 130: Hoare triple {53886#false} assume !(node6_~m6~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 131: Hoare triple {53886#false} ~mode6~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {53886#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {53886#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 134: Hoare triple {53886#false} assume !(node7_~m7~0#1 != ~nomsg~0); {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 135: Hoare triple {53886#false} ~mode7~0 := 0; {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 136: Hoare triple {53886#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 137: Hoare triple {53886#false} assume !(0 != ~mode8~0 % 256); {53886#false} is VALID [2022-02-21 04:31:33,934 INFO L290 TraceCheckUtils]: 138: Hoare triple {53886#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 139: Hoare triple {53886#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 140: Hoare triple {53886#false} assume { :end_inline_node8 } true;~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;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 141: Hoare triple {53886#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 142: Hoare triple {53886#false} assume !(~r1~0 % 256 >= 8); {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 143: Hoare triple {53886#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 144: Hoare triple {53886#false} assume ~r1~0 % 256 < 8;check_~tmp~1#1 := 1; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 145: Hoare triple {53886#false} check_#res#1 := check_~tmp~1#1; {53886#false} is VALID [2022-02-21 04:31:33,935 INFO L290 TraceCheckUtils]: 146: Hoare triple {53886#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {53886#false} is VALID [2022-02-21 04:31:33,936 INFO L290 TraceCheckUtils]: 147: Hoare triple {53886#false} assume !(0 == assert_~arg#1 % 256); {53886#false} is VALID [2022-02-21 04:31:33,936 INFO L290 TraceCheckUtils]: 148: Hoare triple {53886#false} assume { :end_inline_assert } true; {53886#false} is VALID [2022-02-21 04:31:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 04:31:33,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:33,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041572151] [2022-02-21 04:31:33,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041572151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:33,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:33,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:33,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272873005] [2022-02-21 04:31:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:38,200 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:38,200 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:38,200 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:38,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:38,201 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:38,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:38,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:38,201 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:38,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c_Iteration13_Loop [2022-02-21 04:31:38,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:38,201 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:38,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:38,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:40,709 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2022-02-21 04:31:47,312 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 124416 conjuctions. This might take some time...