./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.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 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:33:54,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:33:54,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:33:54,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:33:54,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:33:54,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:33:54,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:33:54,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:33:54,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:33:54,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:33:54,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:33:54,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:33:54,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:33:54,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:33:54,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:33:54,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:33:54,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:33:54,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:33:54,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:33:54,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:33:54,208 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:33:54,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:33:54,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:33:54,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:33:54,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:33:54,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:33:54,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:33:54,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:33:54,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:33:54,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:33:54,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:33:54,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:33:54,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:33:54,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:33:54,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:33:54,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:33:54,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:33:54,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:33:54,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:33:54,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:33:54,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:33:54,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:33:54,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:33:54,240 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:33:54,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:33:54,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:33:54,241 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:33:54,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:33:54,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:33:54,242 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:33:54,242 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:33:54,242 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:33:54,242 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:33:54,243 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:33:54,243 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:33:54,243 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:33:54,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:33:54,243 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:33:54,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:33:54,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:33:54,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:33:54,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:33:54,245 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:33:54,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:33:54,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:33:54,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:33:54,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:33:54,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:33:54,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:33:54,247 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:33:54,248 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 -> 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d [2022-07-13 04:33:54,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:33:54,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:33:54,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:33:54,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:33:54,491 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:33:54,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:54,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffd8417f/9b028c9f55b9447a835bd8c73c794143/FLAG2071ef349 [2022-07-13 04:33:54,980 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:33:54,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:54,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffd8417f/9b028c9f55b9447a835bd8c73c794143/FLAG2071ef349 [2022-07-13 04:33:55,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffd8417f/9b028c9f55b9447a835bd8c73c794143 [2022-07-13 04:33:55,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:33:55,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:33:55,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:33:55,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:33:55,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:33:55,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fde98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55, skipping insertion in model container [2022-07-13 04:33:55,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:33:55,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:33:55,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2022-07-13 04:33:55,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:33:55,270 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:33:55,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2022-07-13 04:33:55,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:33:55,318 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:33:55,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55 WrapperNode [2022-07-13 04:33:55,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:33:55,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:33:55,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:33:55,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:33:55,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,352 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 304 [2022-07-13 04:33:55,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:33:55,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:33:55,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:33:55,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:33:55,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:33:55,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:33:55,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:33:55,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:33:55,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (1/1) ... [2022-07-13 04:33:55,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:33:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:33:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:33:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:33:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:33:55,529 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:33:55,530 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:33:55,838 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:33:55,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:33:55,852 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 04:33:55,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:55 BoogieIcfgContainer [2022-07-13 04:33:55,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:33:55,854 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:33:55,855 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:33:55,863 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:33:55,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:55,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:33:55" (1/3) ... [2022-07-13 04:33:55,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53901af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:33:55, skipping insertion in model container [2022-07-13 04:33:55,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:55,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:55" (2/3) ... [2022-07-13 04:33:55,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53901af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:33:55, skipping insertion in model container [2022-07-13 04:33:55,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:55,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:55" (3/3) ... [2022-07-13 04:33:55,866 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:55,901 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:33:55,901 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:33:55,901 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:33:55,902 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:33:55,902 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:33:55,902 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:33:55,902 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:33:55,902 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:33:55,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:55,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-07-13 04:33:55,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:55,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:55,933 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:33:55,933 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:55,934 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:33:55,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:55,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-07-13 04:33:55,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:55,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:55,943 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:33:55,943 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:55,948 INFO L752 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 30#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 44#L201true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 70#L201-1true init_#res#1 := init_~tmp~0#1; 25#L298true main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 76#L350true assume !(0 == main_~i2~0#1); 81#L350-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 67#L360-2true [2022-07-13 04:33:55,949 INFO L754 eck$LassoCheckResult]: Loop: 67#L360-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 100#L65true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 12#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 94#L69-1true ~mode1~0 := 0; 29#L65-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 40#L100true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 87#L103true assume !(node2_~m2~0#1 != ~nomsg~0); 32#L103-1true ~mode2~0 := 0; 74#L100-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 89#L134true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 42#L137true assume !(node3_~m3~0#1 != ~nomsg~0); 59#L137-1true ~mode3~0 := 0; 45#L134-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 5#L168true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 83#L171true assume !(node4_~m4~0#1 != ~nomsg~0); 22#L171-1true ~mode4~0 := 0; 11#L168-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 95#L306true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 84#L306-1true check_#res#1 := check_~tmp~1#1; 92#L318true main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 37#L387true assume !(0 == assert_~arg#1 % 256); 85#L382true assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 67#L360-2true [2022-07-13 04:33:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-07-13 04:33:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:55,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069765220] [2022-07-13 04:33:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:33:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069765220] [2022-07-13 04:33:56,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069765220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:56,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:56,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25977146] [2022-07-13 04:33:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:56,124 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:33:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 1 times [2022-07-13 04:33:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619367053] [2022-07-13 04:33:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:33:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:56,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619367053] [2022-07-13 04:33:56,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619367053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:56,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:56,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780411837] [2022-07-13 04:33:56,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:56,276 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:33:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:33:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:33:56,303 INFO L87 Difference]: Start difference. First operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:56,395 INFO L93 Difference]: Finished difference Result 167 states and 268 transitions. [2022-07-13 04:33:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:33:56,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 268 transitions. [2022-07-13 04:33:56,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-13 04:33:56,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 158 states and 236 transitions. [2022-07-13 04:33:56,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-07-13 04:33:56,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2022-07-13 04:33:56,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 236 transitions. [2022-07-13 04:33:56,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:56,408 INFO L369 hiAutomatonCegarLoop]: Abstraction has 158 states and 236 transitions. [2022-07-13 04:33:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 236 transitions. [2022-07-13 04:33:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2022-07-13 04:33:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2022-07-13 04:33:56,437 INFO L392 hiAutomatonCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-07-13 04:33:56,437 INFO L374 stractBuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-07-13 04:33:56,437 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:33:56,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 133 transitions. [2022-07-13 04:33:56,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-13 04:33:56,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:56,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:56,446 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:56,446 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:56,451 INFO L752 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 363#L201 assume 0 == ~r1~0; 333#L202 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 334#L203 assume ~id1~0 >= 0; 349#L204 assume 0 == ~st1~0; 306#L205 assume ~send1~0 == ~id1~0; 307#L206 assume 0 == ~mode1~0 % 256; 295#L207 assume ~id2~0 >= 0; 296#L208 assume 0 == ~st2~0; 359#L209 assume ~send2~0 == ~id2~0; 310#L210 assume 0 == ~mode2~0 % 256; 311#L211 assume ~id3~0 >= 0; 300#L212 assume 0 == ~st3~0; 301#L213 assume ~send3~0 == ~id3~0; 374#L214 assume 0 == ~mode3~0 % 256; 375#L215 assume ~id4~0 >= 0; 358#L216 assume 0 == ~st4~0; 337#L217 assume ~send4~0 == ~id4~0; 338#L218 assume 0 == ~mode4~0 % 256; 366#L219 assume ~id1~0 != ~id2~0; 377#L220 assume ~id1~0 != ~id3~0; 329#L221 assume ~id1~0 != ~id4~0; 325#L222 assume ~id2~0 != ~id3~0; 326#L223 assume ~id2~0 != ~id4~0; 316#L224 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 317#L201-1 init_#res#1 := init_~tmp~0#1; 346#L298 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 354#L350 assume !(0 == main_~i2~0#1); 357#L350-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 341#L360-2 [2022-07-13 04:33:56,451 INFO L754 eck$LassoCheckResult]: Loop: 341#L360-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 342#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 318#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 292#L69-1 ~mode1~0 := 0; 360#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 361#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 370#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 331#L103-1 ~mode2~0 := 0; 355#L100-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 356#L134 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 373#L137 assume !(node3_~m3~0#1 != ~nomsg~0); 314#L137-1 ~mode3~0 := 0; 315#L134-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 288#L168 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 290#L171 assume !(node4_~m4~0#1 != ~nomsg~0); 345#L171-1 ~mode4~0 := 0; 304#L168-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 312#L306 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 294#L306-1 check_#res#1 := check_~tmp~1#1; 368#L318 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 371#L387 assume !(0 == assert_~arg#1 % 256); 369#L382 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 341#L360-2 [2022-07-13 04:33:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-07-13 04:33:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226224434] [2022-07-13 04:33:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 2 times [2022-07-13 04:33:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559949367] [2022-07-13 04:33:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:33:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559949367] [2022-07-13 04:33:56,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559949367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:56,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548735157] [2022-07-13 04:33:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:56,611 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:33:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:33:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:33:56,612 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:56,646 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2022-07-13 04:33:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:33:56,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 135 transitions. [2022-07-13 04:33:56,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-13 04:33:56,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 94 states and 131 transitions. [2022-07-13 04:33:56,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-07-13 04:33:56,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-13 04:33:56,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 131 transitions. [2022-07-13 04:33:56,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:56,653 INFO L369 hiAutomatonCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-13 04:33:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 131 transitions. [2022-07-13 04:33:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-13 04:33:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2022-07-13 04:33:56,660 INFO L392 hiAutomatonCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-13 04:33:56,660 INFO L374 stractBuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-13 04:33:56,660 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:33:56,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. [2022-07-13 04:33:56,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-13 04:33:56,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:56,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:56,663 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:56,664 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 04:33:56,664 INFO L752 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 566#L201 assume 0 == ~r1~0; 536#L202 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 537#L203 assume ~id1~0 >= 0; 552#L204 assume 0 == ~st1~0; 508#L205 assume ~send1~0 == ~id1~0; 509#L206 assume 0 == ~mode1~0 % 256; 496#L207 assume ~id2~0 >= 0; 497#L208 assume 0 == ~st2~0; 562#L209 assume ~send2~0 == ~id2~0; 513#L210 assume 0 == ~mode2~0 % 256; 514#L211 assume ~id3~0 >= 0; 503#L212 assume 0 == ~st3~0; 504#L213 assume ~send3~0 == ~id3~0; 577#L214 assume 0 == ~mode3~0 % 256; 578#L215 assume ~id4~0 >= 0; 561#L216 assume 0 == ~st4~0; 540#L217 assume ~send4~0 == ~id4~0; 541#L218 assume 0 == ~mode4~0 % 256; 567#L219 assume ~id1~0 != ~id2~0; 580#L220 assume ~id1~0 != ~id3~0; 530#L221 assume ~id1~0 != ~id4~0; 528#L222 assume ~id2~0 != ~id3~0; 529#L223 assume ~id2~0 != ~id4~0; 519#L224 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 520#L201-1 init_#res#1 := init_~tmp~0#1; 548#L298 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 556#L350 assume !(0 == main_~i2~0#1); 560#L350-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 544#L360-2 [2022-07-13 04:33:56,664 INFO L754 eck$LassoCheckResult]: Loop: 544#L360-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 545#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 521#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 492#L69-1 ~mode1~0 := 0; 563#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 564#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 573#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 534#L103-1 ~mode2~0 := 0; 557#L100-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 559#L134 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 576#L137 assume !(node3_~m3~0#1 != ~nomsg~0); 517#L137-1 ~mode3~0 := 0; 518#L134-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 493#L168 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 495#L171 assume !(node4_~m4~0#1 != ~nomsg~0); 551#L171-1 ~mode4~0 := 0; 507#L168-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 515#L306 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 516#L307 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 502#L306-1 check_#res#1 := check_~tmp~1#1; 571#L318 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 575#L387 assume !(0 == assert_~arg#1 % 256); 572#L382 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 544#L360-2 [2022-07-13 04:33:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-07-13 04:33:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767969854] [2022-07-13 04:33:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2027257471, now seen corresponding path program 1 times [2022-07-13 04:33:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711721402] [2022-07-13 04:33:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:56,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2125885643, now seen corresponding path program 1 times [2022-07-13 04:33:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:56,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575735659] [2022-07-13 04:33:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:33:56,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575735659] [2022-07-13 04:33:56,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575735659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:56,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:56,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:33:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210535240] [2022-07-13 04:33:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:57,390 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:33:57,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:33:57,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:33:57,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:33:57,391 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:33:57,392 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:57,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:33:57,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:33:57,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-13 04:33:57,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:33:57,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:33:57,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:57,918 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:33:57,919 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:33:57,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:57,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:57,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:57,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:33:57,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:33:57,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:33:57,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:57,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) [2022-07-13 04:33:57,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 [2022-07-13 04:33:57,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:33:57,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:33:58,134 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:33:58,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:58,140 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:33:58,140 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:33:58,140 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:33:58,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:33:58,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:33:58,140 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:33:58,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:33:58,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-13 04:33:58,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:33:58,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:33:58,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:58,687 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:33:58,691 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:33:58,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:58,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:58,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:33:58,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:33:58,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:58,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:58,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:58,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:58,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:58,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:58,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:58,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:58,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:58,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:58,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:58,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:33:58,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 [2022-07-13 04:33:58,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:58,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:58,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:58,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:58,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:58,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:58,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:58,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:58,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:58,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:58,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:58,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:33:58,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:33:58,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:58,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:58,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:58,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:58,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:58,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:58,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:58,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:58,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:58,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:58,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:58,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:33:58,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:33:58,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:58,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:58,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:58,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:58,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:58,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:58,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:58,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:33:58,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:33:58,888 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:33:58,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:58,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:58,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:33:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:33:58,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:33:58,892 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:33:58,893 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:33:58,893 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-07-13 04:33:58,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-13 04:33:58,911 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:33:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:58,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:33:58,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:33:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:59,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:33:59,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:33:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:33:59,106 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 [2022-07-13 04:33:59,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:59,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 158 states and 233 transitions. Complement of second has 4 states. [2022-07-13 04:33:59,149 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 [2022-07-13 04:33:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-07-13 04:33:59,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 23 letters. [2022-07-13 04:33:59,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:59,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 53 letters. Loop has 23 letters. [2022-07-13 04:33:59,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:59,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 46 letters. [2022-07-13 04:33:59,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:59,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 233 transitions. [2022-07-13 04:33:59,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:59,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 0 states and 0 transitions. [2022-07-13 04:33:59,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 04:33:59,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 04:33:59,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 04:33:59,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:59,161 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:59,162 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:59,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:33:59,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:33:59,163 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:59,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-13 04:33:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:33:59,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-13 04:33:59,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:59,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 04:33:59,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 04:33:59,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 04:33:59,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 04:33:59,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:59,167 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:59,167 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:59,167 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:59,167 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:33:59,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 04:33:59,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:59,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 04:33:59,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:33:59 BoogieIcfgContainer [2022-07-13 04:33:59,174 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:33:59,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:33:59,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:33:59,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:33:59,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:55" (3/4) ... [2022-07-13 04:33:59,177 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 04:33:59,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:33:59,178 INFO L158 Benchmark]: Toolchain (without parser) took 4169.02ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 64.7MB in the beginning and 96.5MB in the end (delta: -31.8MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,179 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 53.1MB in the beginning and 53.0MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:33:59,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.05ms. Allocated memory is still 98.6MB. Free memory was 64.6MB in the beginning and 70.4MB in the end (delta: -5.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 98.6MB. Free memory was 70.4MB in the beginning and 68.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,182 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,183 INFO L158 Benchmark]: RCFGBuilder took 473.26ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 46.8MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,183 INFO L158 Benchmark]: BuchiAutomizer took 3319.80ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 46.6MB in the beginning and 97.5MB in the end (delta: -50.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-13 04:33:59,183 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 96.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:33:59,191 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.18ms. Allocated memory is still 98.6MB. Free memory was 53.1MB in the beginning and 53.0MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.05ms. Allocated memory is still 98.6MB. Free memory was 64.6MB in the beginning and 70.4MB in the end (delta: -5.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 98.6MB. Free memory was 70.4MB in the beginning and 68.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.26ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 46.8MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 3319.80ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 46.6MB in the beginning and 97.5MB in the end (delta: -50.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 96.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 1348 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 930 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 418 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div129 bol100 ite100 ukn100 eq175 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 04:33:59,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:59,426 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE