./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.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 d38cb1f845b15389118500fb2a6bd7544a463af2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:44:39,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:44:39,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:44:39,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:44:39,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:44:39,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:44:39,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:44:39,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:44:39,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:44:39,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:44:39,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:44:39,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:44:39,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:44:39,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:44:39,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:44:39,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:44:39,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:44:39,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:44:39,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:44:39,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:44:39,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:44:39,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:44:39,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:44:39,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:44:39,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:44:39,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:44:39,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:44:39,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:44:39,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:44:39,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:44:39,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:44:39,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:44:39,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:44:39,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:44:39,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:44:39,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:44:39,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:44:39,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:44:39,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:44:39,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:44:39,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:44:39,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:44:39,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:44:39,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:44:39,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:44:39,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:44:39,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:44:39,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:44:39,972 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:44:39,972 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:44:39,972 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:44:39,973 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:44:39,973 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:44:39,973 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:44:39,973 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:44:39,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:44:39,973 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:44:39,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:44:39,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:44:39,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:44:39,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:44:39,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:44:39,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:44:39,976 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:44:39,977 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 -> d38cb1f845b15389118500fb2a6bd7544a463af2 [2021-08-27 16:44:40,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:44:40,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:44:40,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:44:40,210 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:44:40,214 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:44:40,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-08-27 16:44:40,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6518872e2/c6a893a3c1f5445c8517d40cc84eb819/FLAG60b139a1a [2021-08-27 16:44:40,615 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:44:40,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-08-27 16:44:40,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6518872e2/c6a893a3c1f5445c8517d40cc84eb819/FLAG60b139a1a [2021-08-27 16:44:41,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6518872e2/c6a893a3c1f5445c8517d40cc84eb819 [2021-08-27 16:44:41,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:44:41,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:44:41,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:44:41,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:44:41,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:44:41,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bd82a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41, skipping insertion in model container [2021-08-27 16:44:41,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:44:41,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:44:41,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12835,12848] [2021-08-27 16:44:41,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:44:41,228 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:44:41,258 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12835,12848] [2021-08-27 16:44:41,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:44:41,267 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:44:41,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41 WrapperNode [2021-08-27 16:44:41,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:44:41,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:44:41,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:44:41,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:44:41,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:44:41,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:44:41,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:44:41,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:44:41,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:44:41,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:44:41,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:44:41,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:44:41,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (1/1) ... [2021-08-27 16:44:41,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:41,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 16:44:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:44:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:44:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:44:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:44:42,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:44:42,105 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 16:44:42,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:44:42 BoogieIcfgContainer [2021-08-27 16:44:42,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:44:42,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:44:42,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:44:42,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:44:42,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:44:42,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:44:41" (1/3) ... [2021-08-27 16:44:42,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b52b152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:44:42, skipping insertion in model container [2021-08-27 16:44:42,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:44:42,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:44:41" (2/3) ... [2021-08-27 16:44:42,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b52b152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:44:42, skipping insertion in model container [2021-08-27 16:44:42,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:44:42,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:44:42" (3/3) ... [2021-08-27 16:44:42,112 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-08-27 16:44:42,135 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:44:42,135 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:44:42,135 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:44:42,136 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:44:42,136 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:44:42,136 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:44:42,136 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:44:42,136 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:44:42,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-08-27 16:44:42,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:44:42,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:44:42,165 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] [2021-08-27 16:44:42,165 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:44:42,165 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:44:42,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-08-27 16:44:42,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:44:42,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:44:42,176 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] [2021-08-27 16:44:42,176 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:44:42,180 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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]; 50#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 128#L229true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 104#L232-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 129#L242true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 36#L245-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 19#L255true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 14#L258-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 24#L268true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 26#L271-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 16#L281true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 59#L284-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 112#L294true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 42#L297-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 87#L307true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 31#L307-1true init_#res := init_~tmp___5~0; 20#L416true main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 91#L510true assume !(0 == main_~i2~0); 8#L510-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 102#L524-2true [2021-08-27 16:44:42,181 INFO L793 eck$LassoCheckResult]: Loop: 102#L524-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 71#L75true assume !(0 != ~mode1~0 % 256); 67#L100true assume !(~r1~0 < 1); 85#L100-1true ~mode1~0 := 1; 116#L75-2true havoc node2_#t~ite9, node2_#t~ite10; 100#L118true assume !(0 != ~mode2~0 % 256); 101#L143true assume !(~r2~0 < 2); 94#L143-1true ~mode2~0 := 1; 68#L118-2true havoc node3_#t~ite11, node3_#t~ite12; 15#L161true assume !(0 != ~mode3~0 % 256); 75#L186true assume !(~r3~0 < 2); 30#L186-1true ~mode3~0 := 1; 6#L161-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 110#L424true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 124#L424-1true check_#res := check_~tmp~1; 45#L472true main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 132#L554true assume !(0 == assert_~arg % 256); 58#L549true main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 102#L524-2true [2021-08-27 16:44:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-08-27 16:44:42,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180809803] [2021-08-27 16:44:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180809803] [2021-08-27 16:44:42,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180809803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:44:42,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390727940] [2021-08-27 16:44:42,394 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:44:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2021-08-27 16:44:42,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102556494] [2021-08-27 16:44:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102556494] [2021-08-27 16:44:42,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102556494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:44:42,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419213525] [2021-08-27 16:44:42,472 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:44:42,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:44:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:44:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:44:42,481 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:44:42,540 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2021-08-27 16:44:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:44:42,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2021-08-27 16:44:42,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-08-27 16:44:42,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2021-08-27 16:44:42,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-08-27 16:44:42,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-08-27 16:44:42,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2021-08-27 16:44:42,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:44:42,552 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-08-27 16:44:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2021-08-27 16:44:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-08-27 16:44:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2021-08-27 16:44:42,572 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-08-27 16:44:42,572 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-08-27 16:44:42,572 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:44:42,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2021-08-27 16:44:42,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-08-27 16:44:42,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:44:42,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:44:42,575 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] [2021-08-27 16:44:42,575 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] [2021-08-27 16:44:42,575 INFO L791 eck$LassoCheckResult]: Stem: 404#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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]; 358#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 359#L229 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 385#L232-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 397#L242 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 339#L245-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 315#L255 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 305#L258-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 306#L268 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 326#L271-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 310#L281 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 311#L284-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 370#L294 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 347#L297-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 349#L307 assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 284#L307-1 init_#res := init_~tmp___5~0; 317#L416 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 318#L510 assume !(0 == main_~i2~0); 292#L510-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 293#L524-2 [2021-08-27 16:44:42,576 INFO L793 eck$LassoCheckResult]: Loop: 293#L524-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 380#L75 assume !(0 != ~mode1~0 % 256); 377#L100 assume !(~r1~0 < 1); 360#L100-1 ~mode1~0 := 1; 331#L75-2 havoc node2_#t~ite9, node2_#t~ite10; 395#L118 assume !(0 != ~mode2~0 % 256); 396#L143 assume !(~r2~0 < 2); 356#L143-1 ~mode2~0 := 1; 379#L118-2 havoc node3_#t~ite11, node3_#t~ite12; 307#L161 assume !(0 != ~mode3~0 % 256); 309#L186 assume !(~r3~0 < 2); 334#L186-1 ~mode3~0 := 1; 290#L161-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 291#L424 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 400#L425 assume ~st1~0 + ~nl1~0 <= 1; 401#L426 assume ~st2~0 + ~nl2~0 <= 1; 393#L427 assume ~st3~0 + ~nl3~0 <= 1; 394#L428 assume ~r1~0 >= 2; 392#L432 assume ~r1~0 < 2; 287#L437 assume ~r1~0 >= 2; 289#L442 assume ~r1~0 < 2;check_~tmp~1 := 1; 335#L424-1 check_#res := check_~tmp~1; 354#L472 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 355#L554 assume !(0 == assert_~arg % 256); 369#L549 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 293#L524-2 [2021-08-27 16:44:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-08-27 16:44:42,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207466483] [2021-08-27 16:44:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207466483] [2021-08-27 16:44:42,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207466483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:44:42,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414098410] [2021-08-27 16:44:42,620 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:44:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2021-08-27 16:44:42,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222246246] [2021-08-27 16:44:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222246246] [2021-08-27 16:44:42,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222246246] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:44:42,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699708986] [2021-08-27 16:44:42,649 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:44:42,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:44:42,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:44:42,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:44:42,650 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:44:42,708 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2021-08-27 16:44:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:44:42,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2021-08-27 16:44:42,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-08-27 16:44:42,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2021-08-27 16:44:42,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2021-08-27 16:44:42,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2021-08-27 16:44:42,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2021-08-27 16:44:42,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:44:42,715 INFO L681 BuchiCegarLoop]: Abstraction has 193 states and 291 transitions. [2021-08-27 16:44:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2021-08-27 16:44:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2021-08-27 16:44:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 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) [2021-08-27 16:44:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2021-08-27 16:44:42,722 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-08-27 16:44:42,722 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-08-27 16:44:42,722 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:44:42,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2021-08-27 16:44:42,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-08-27 16:44:42,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:44:42,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:44:42,725 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] [2021-08-27 16:44:42,725 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] [2021-08-27 16:44:42,725 INFO L791 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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]; 692#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 693#L229 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 719#L232-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 731#L242 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 673#L245-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 648#L255 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 638#L258-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 639#L268 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 659#L271-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 643#L281 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 644#L284-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 704#L294 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 681#L297-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 683#L307 assume ~id1~0 != ~id2~0; 636#L308 assume ~id1~0 != ~id3~0; 637#L309 assume ~id2~0 != ~id3~0; 723#L310 assume ~id1~0 >= 0; 705#L311 assume ~id2~0 >= 0; 706#L312 assume ~id3~0 >= 0; 665#L313 assume 0 == ~r1~0; 666#L314 assume 0 == ~r2~0; 697#L315 assume 0 == ~r3~0; 698#L316 assume 0 != init_~r122~0 % 256; 618#L317 assume 0 != init_~r132~0 % 256; 619#L318 assume 0 != init_~r212~0 % 256; 739#L319 assume 0 != init_~r232~0 % 256; 725#L320 assume 0 != init_~r312~0 % 256; 720#L321 assume 0 != init_~r322~0 % 256; 721#L322 assume ~max1~0 == ~id1~0; 616#L323 assume ~max2~0 == ~id2~0; 617#L324 assume ~max3~0 == ~id3~0; 646#L325 assume 0 == ~st1~0; 675#L326 assume 0 == ~st2~0; 657#L327 assume 0 == ~st3~0; 658#L328 assume 0 == ~nl1~0; 688#L329 assume 0 == ~nl2~0; 689#L330 assume 0 == ~nl3~0; 634#L331 assume 0 == ~mode1~0 % 256; 635#L332 assume 0 == ~mode2~0 % 256; 671#L333 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 668#L307-1 init_#res := init_~tmp___5~0; 650#L416 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 651#L510 assume !(0 == main_~i2~0); 625#L510-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 626#L524-2 [2021-08-27 16:44:42,725 INFO L793 eck$LassoCheckResult]: Loop: 626#L524-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 714#L75 assume !(0 != ~mode1~0 % 256); 711#L100 assume !(~r1~0 < 1); 694#L100-1 ~mode1~0 := 1; 664#L75-2 havoc node2_#t~ite9, node2_#t~ite10; 729#L118 assume !(0 != ~mode2~0 % 256); 730#L143 assume !(~r2~0 < 2); 690#L143-1 ~mode2~0 := 1; 713#L118-2 havoc node3_#t~ite11, node3_#t~ite12; 640#L161 assume !(0 != ~mode3~0 % 256); 642#L186 assume !(~r3~0 < 2); 667#L186-1 ~mode3~0 := 1; 620#L161-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 621#L424 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 734#L425 assume ~st1~0 + ~nl1~0 <= 1; 735#L426 assume ~st2~0 + ~nl2~0 <= 1; 727#L427 assume ~st3~0 + ~nl3~0 <= 1; 728#L428 assume ~r1~0 >= 2; 726#L432 assume ~r1~0 < 2; 622#L437 assume ~r1~0 >= 2; 624#L442 assume ~r1~0 < 2;check_~tmp~1 := 1; 669#L424-1 check_#res := check_~tmp~1; 686#L472 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 687#L554 assume !(0 == assert_~arg % 256); 703#L549 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 626#L524-2 [2021-08-27 16:44:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-08-27 16:44:42,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550380381] [2021-08-27 16:44:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,752 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:44:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,811 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:44:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2021-08-27 16:44:42,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789179837] [2021-08-27 16:44:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789179837] [2021-08-27 16:44:42,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789179837] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:44:42,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107319885] [2021-08-27 16:44:42,832 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:44:42,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:44:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:44:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:44:42,833 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:44:42,859 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2021-08-27 16:44:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:44:42,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2021-08-27 16:44:42,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-08-27 16:44:42,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2021-08-27 16:44:42,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-08-27 16:44:42,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-08-27 16:44:42,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2021-08-27 16:44:42,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:44:42,864 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-08-27 16:44:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2021-08-27 16:44:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-08-27 16:44:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2021-08-27 16:44:42,870 INFO L704 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-08-27 16:44:42,870 INFO L587 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-08-27 16:44:42,870 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:44:42,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2021-08-27 16:44:42,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-08-27 16:44:42,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:44:42,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:44:42,872 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] [2021-08-27 16:44:42,872 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] [2021-08-27 16:44:42,872 INFO L791 eck$LassoCheckResult]: Stem: 1051#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(39);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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]; 1001#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~ret40, main_#t~ret41, main_#t~post42, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep13~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep31~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep32~0 := main_#t~nondet18;havoc main_#t~nondet18;~id1~0 := main_#t~nondet19;havoc main_#t~nondet19;~r1~0 := main_#t~nondet20;havoc main_#t~nondet20;~st1~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl1~0 := main_#t~nondet22;havoc main_#t~nondet22;~m1~0 := main_#t~nondet23;havoc main_#t~nondet23;~max1~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode1~0 := main_#t~nondet25;havoc main_#t~nondet25;~id2~0 := main_#t~nondet26;havoc main_#t~nondet26;~r2~0 := main_#t~nondet27;havoc main_#t~nondet27;~st2~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl2~0 := main_#t~nondet29;havoc main_#t~nondet29;~m2~0 := main_#t~nondet30;havoc main_#t~nondet30;~max2~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode2~0 := main_#t~nondet32;havoc main_#t~nondet32;~id3~0 := main_#t~nondet33;havoc main_#t~nondet33;~r3~0 := main_#t~nondet34;havoc main_#t~nondet34;~st3~0 := main_#t~nondet35;havoc main_#t~nondet35;~nl3~0 := main_#t~nondet36;havoc main_#t~nondet36;~m3~0 := main_#t~nondet37;havoc main_#t~nondet37;~max3~0 := main_#t~nondet38;havoc main_#t~nondet38;~mode3~0 := main_#t~nondet39;havoc main_#t~nondet39;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 1002#L229 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1029#L232-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1043#L242 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 983#L245-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 958#L255 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 945#L258-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 946#L268 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 969#L271-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 950#L281 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 951#L284-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1014#L294 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 990#L297-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 992#L307 assume ~id1~0 != ~id2~0; 943#L308 assume ~id1~0 != ~id3~0; 944#L309 assume ~id2~0 != ~id3~0; 1033#L310 assume ~id1~0 >= 0; 1015#L311 assume ~id2~0 >= 0; 1016#L312 assume ~id3~0 >= 0; 975#L313 assume 0 == ~r1~0; 976#L314 assume 0 == ~r2~0; 1004#L315 assume 0 == ~r3~0; 1005#L316 assume 0 != init_~r122~0 % 256; 926#L317 assume 0 != init_~r132~0 % 256; 927#L318 assume 0 != init_~r212~0 % 256; 1054#L319 assume 0 != init_~r232~0 % 256; 1036#L320 assume 0 != init_~r312~0 % 256; 1030#L321 assume 0 != init_~r322~0 % 256; 1031#L322 assume ~max1~0 == ~id1~0; 924#L323 assume ~max2~0 == ~id2~0; 925#L324 assume ~max3~0 == ~id3~0; 953#L325 assume 0 == ~st1~0; 981#L326 assume 0 == ~st2~0; 965#L327 assume 0 == ~st3~0; 966#L328 assume 0 == ~nl1~0; 995#L329 assume 0 == ~nl2~0; 996#L330 assume 0 == ~nl3~0; 941#L331 assume 0 == ~mode1~0 % 256; 942#L332 assume 0 == ~mode2~0 % 256; 980#L333 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 978#L307-1 init_#res := init_~tmp___5~0; 956#L416 main_#t~ret40 := init_#res;main_~i2~0 := main_#t~ret40;havoc main_#t~ret40; 957#L510 assume !(0 == main_~i2~0); 932#L510-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 933#L524-2 [2021-08-27 16:44:42,872 INFO L793 eck$LassoCheckResult]: Loop: 933#L524-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8; 1059#L75 assume !(0 != ~mode1~0 % 256); 1058#L100 assume !(~r1~0 < 1); 1003#L100-1 ~mode1~0 := 1; 1094#L75-2 havoc node2_#t~ite9, node2_#t~ite10; 1092#L118 assume !(0 != ~mode2~0 % 256); 1093#L143 assume !(~r2~0 < 2); 1085#L143-1 ~mode2~0 := 1; 1082#L118-2 havoc node3_#t~ite11, node3_#t~ite12; 1080#L161 assume !(0 != ~mode3~0 % 256); 1076#L186 assume !(~r3~0 < 2); 1072#L186-1 ~mode3~0 := 1; 1070#L161-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1069#L424 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1068#L425 assume ~st1~0 + ~nl1~0 <= 1; 1067#L426 assume ~st2~0 + ~nl2~0 <= 1; 1066#L427 assume ~st3~0 + ~nl3~0 <= 1; 1065#L428 assume !(~r1~0 >= 2); 1055#L431 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1056#L432 assume ~r1~0 < 2; 1064#L437 assume !(~r1~0 >= 2); 967#L441 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 968#L442 assume ~r1~0 < 2;check_~tmp~1 := 1; 1063#L424-1 check_#res := check_~tmp~1; 1062#L472 main_#t~ret41 := check_#res;main_~c1~0 := main_#t~ret41;havoc main_#t~ret41;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1061#L554 assume !(0 == assert_~arg % 256); 1060#L549 main_#t~post42 := main_~i2~0;main_~i2~0 := 1 + main_#t~post42;havoc main_#t~post42; 933#L524-2 [2021-08-27 16:44:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-08-27 16:44:42,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506998569] [2021-08-27 16:44:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,892 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:44:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,927 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:44:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -77605116, now seen corresponding path program 1 times [2021-08-27 16:44:42,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182646495] [2021-08-27 16:44:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,933 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:44:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:44:42,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:44:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2113327686, now seen corresponding path program 1 times [2021-08-27 16:44:42,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:44:42,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250297551] [2021-08-27 16:44:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:44:42,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:44:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:42,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:44:42,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250297551] [2021-08-27 16:44:42,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250297551] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:44:42,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:44:42,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:44:42,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363376678] [2021-08-27 16:44:43,478 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:44:43,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:44:43,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:44:43,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:44:43,479 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:44:43,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:43,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:44:43,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:44:43,480 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:44:43,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:44:43,480 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:44:43,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:43,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:44:43,901 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:44:43,903 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:43,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:43,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 16:44:43,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:44:43,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:44:43,969 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 [2021-08-27 16:44:43,969 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:43,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:43,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:43,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 16:44:43,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:44:43,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:44:44,074 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:44:44,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,079 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:44:44,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:44:44,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:44:44,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:44:44,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:44:44,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:44:44,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:44:44,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:44:44,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:44:44,080 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:44:44,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:44:44,487 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:44:44,490 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:44:44,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 16:44:44,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,548 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 16:44:44,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:44:44,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:44:44,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,592 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 16:44:44,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,622 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 [2021-08-27 16:44:44,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 16:44:44,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 16:44:44,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 [2021-08-27 16:44:44,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-08-27 16:44:44,688 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 16:44:44,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:44:44,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:44:44,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 16:44:44,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,758 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 16:44:44,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,798 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 16:44:44,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:44:44,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:44:44,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:44:44,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:44:44,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,839 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 16:44:44,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 [2021-08-27 16:44:44,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:44:44,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:44:44,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:44:44,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:44:44,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:44:44,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:44:44,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:44:44,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:44:44,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:44:44,866 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:44:44,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:44:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:44:44,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:44:44,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:44:44,869 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:44:44,869 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:44:44,869 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2021-08-27 16:44:44,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 16:44:44,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:44,899 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:44:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:44:45,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 16:44:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:45,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:44:45,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:44:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:44:45,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:44:45,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:44:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:44:45,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 16:44:45,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:45,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 296 states and 445 transitions. Complement of second has 4 states. [2021-08-27 16:44:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 16:44:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2021-08-27 16:44:45,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 27 letters. [2021-08-27 16:44:45,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:44:45,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 72 letters. Loop has 27 letters. [2021-08-27 16:44:45,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:44:45,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 54 letters. [2021-08-27 16:44:45,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:44:45,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 445 transitions. [2021-08-27 16:44:45,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:44:45,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 0 states and 0 transitions. [2021-08-27 16:44:45,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:44:45,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:44:45,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:44:45,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:44:45,393 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:44:45,393 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:44:45,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:44:45,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:44:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:44:45,394 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:44:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:44:45,394 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:44:45,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:44:45,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:44:45,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:44:45,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:44:45,394 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:44:45,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 16:44:45,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:44:45,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 16:44:45,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:44:45 BoogieIcfgContainer [2021-08-27 16:44:45,397 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:44:45,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:44:45,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:44:45,398 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:44:45,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:44:42" (3/4) ... [2021-08-27 16:44:45,400 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 16:44:45,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:44:45,400 INFO L168 Benchmark]: Toolchain (without parser) took 4374.15 ms. Allocated memory was 50.3 MB in the beginning and 155.2 MB in the end (delta: 104.9 MB). Free memory was 27.4 MB in the beginning and 101.7 MB in the end (delta: -74.2 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,401 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.1 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:44:45,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.14 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 27.2 MB in the beginning and 41.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 62.9 MB. Free memory was 41.1 MB in the beginning and 38.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,402 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 62.9 MB. Free memory was 38.2 MB in the beginning and 36.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,402 INFO L168 Benchmark]: RCFGBuilder took 738.22 ms. Allocated memory is still 62.9 MB. Free memory was 36.0 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,402 INFO L168 Benchmark]: BuchiAutomizer took 3290.38 ms. Allocated memory was 62.9 MB in the beginning and 155.2 MB in the end (delta: 92.3 MB). Free memory was 32.5 MB in the beginning and 101.7 MB in the end (delta: -69.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2021-08-27 16:44:45,402 INFO L168 Benchmark]: Witness Printer took 1.93 ms. Allocated memory is still 155.2 MB. Free memory is still 101.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:44:45,404 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.1 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 241.14 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 27.2 MB in the beginning and 41.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.89 ms. Allocated memory is still 62.9 MB. Free memory was 41.1 MB in the beginning and 38.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 62.9 MB. Free memory was 38.2 MB in the beginning and 36.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 738.22 ms. Allocated memory is still 62.9 MB. Free memory was 36.0 MB in the beginning and 32.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3290.38 ms. Allocated memory was 62.9 MB in the beginning and 155.2 MB in the end (delta: 92.3 MB). Free memory was 32.5 MB in the beginning and 101.7 MB in the end (delta: -69.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * Witness Printer took 1.93 ms. Allocated memory is still 155.2 MB. Free memory is still 101.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 24.7ms AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 177 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 854 SDtfs, 375 SDslu, 1505 SDs, 0 SdLazy, 55 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.4ms Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax129 hnf107 lsp22 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 16:44:45,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...