./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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.5.ufo.BOUNDED-10.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 f7497e4203b86f15acb74ef94ae3bce6255aa8233294110bb99f24cde0725dc7 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:01,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:01,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:01,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:01,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:01,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:01,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:01,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:01,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:01,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:01,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:01,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:01,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:01,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:01,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:01,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:01,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:01,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:01,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:01,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:01,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:01,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:01,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:01,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:01,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:01,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:01,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:01,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:01,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:01,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:01,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:01,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:01,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:01,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:01,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:01,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:01,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:01,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:01,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:01,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:01,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:01,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:23:01,591 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:01,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:01,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:01,592 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:01,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:01,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:01,593 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:01,594 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:01,594 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:01,594 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:01,594 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:01,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:01,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:01,596 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:01,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:01,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:01,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:01,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:01,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:01,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:01,598 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:01,598 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 -> f7497e4203b86f15acb74ef94ae3bce6255aa8233294110bb99f24cde0725dc7 [2021-12-15 17:23:01,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:01,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:01,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:01,847 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:01,848 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:01,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-12-15 17:23:01,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200b7758/799aaacd5eb7485fb960b083cdbdd590/FLAGac154c220 [2021-12-15 17:23:02,306 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:02,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-12-15 17:23:02,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200b7758/799aaacd5eb7485fb960b083cdbdd590/FLAGac154c220 [2021-12-15 17:23:02,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0200b7758/799aaacd5eb7485fb960b083cdbdd590 [2021-12-15 17:23:02,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:02,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:02,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:02,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:02,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:02,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:02,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729d0380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02, skipping insertion in model container [2021-12-15 17:23:02,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:02,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:02,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:02,889 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2021-12-15 17:23:02,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:02,897 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:02,958 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2021-12-15 17:23:02,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:02,968 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:02,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02 WrapperNode [2021-12-15 17:23:02,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:02,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:02,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:02,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:02,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:02,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,016 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 315 [2021-12-15 17:23:03,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:03,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:03,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:03,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:03,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:03,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:03,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:03,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:03,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (1/1) ... [2021-12-15 17:23:03,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:03,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:03,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:23:03,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:23:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:03,200 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:03,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:03,523 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:03,528 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:03,529 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:03,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:03 BoogieIcfgContainer [2021-12-15 17:23:03,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:03,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:03,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:03,536 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:03,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:03,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:02" (1/3) ... [2021-12-15 17:23:03,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5081edbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:03, skipping insertion in model container [2021-12-15 17:23:03,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:03,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:02" (2/3) ... [2021-12-15 17:23:03,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5081edbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:03, skipping insertion in model container [2021-12-15 17:23:03,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:03,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:03" (3/3) ... [2021-12-15 17:23:03,539 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-12-15 17:23:03,571 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:03,571 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:03,572 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:03,572 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:03,572 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:03,572 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:03,572 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:03,573 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:03,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:03,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:23:03,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:03,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:03,676 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:03,676 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:03,677 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:03,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:03,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:23:03,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:03,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:03,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:03,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:03,687 INFO L791 eck$LassoCheckResult]: Stem: 70#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 55#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 87#L196true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 91#L196-1true init_#res#1 := init_~tmp~0#1; 89#L321true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 61#L22true assume !(0 == assume_abort_if_not_~cond#1); 38#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 65#L393-2true [2021-12-15 17:23:03,687 INFO L793 eck$LassoCheckResult]: Loop: 65#L393-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 10#L71true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 83#L75true assume !(node1_~m1~0#1 != ~nomsg~0); 37#L75-1true ~mode1~0 := 0; 82#L71-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 13#L97true assume !(0 != ~mode2~0 % 256); 4#L110true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 59#L110-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 77#L97-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 66#L122true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 31#L125true assume !(node3_~m3~0#1 != ~nomsg~0); 32#L125-1true ~mode3~0 := 0; 54#L122-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 67#L147true assume !(0 != ~mode4~0 % 256); 34#L160true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 19#L160-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 26#L147-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 57#L172true assume !(0 != ~mode5~0 % 256); 40#L185true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 64#L185-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 74#L172-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 43#L329true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 71#L329-1true check_#res#1 := check_~tmp~1#1; 27#L349true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 28#L423true assume !(0 == assert_~arg#1 % 256); 21#L418true assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 65#L393-2true [2021-12-15 17:23:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2021-12-15 17:23:03,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:03,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922649996] [2021-12-15 17:23:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:03,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:03,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:03,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922649996] [2021-12-15 17:23:03,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922649996] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:03,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:03,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:03,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522356990] [2021-12-15 17:23:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:03,994 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1781440156, now seen corresponding path program 1 times [2021-12-15 17:23:03,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:03,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050761075] [2021-12-15 17:23:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:03,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:04,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:04,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050761075] [2021-12-15 17:23:04,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050761075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:04,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:04,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:04,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688236015] [2021-12-15 17:23:04,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:04,158 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:04,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:04,180 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:04,233 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2021-12-15 17:23:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:04,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2021-12-15 17:23:04,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:23:04,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2021-12-15 17:23:04,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-12-15 17:23:04,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-12-15 17:23:04,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2021-12-15 17:23:04,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:04,244 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-15 17:23:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2021-12-15 17:23:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-15 17:23:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2021-12-15 17:23:04,263 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-15 17:23:04,263 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-12-15 17:23:04,264 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:04,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2021-12-15 17:23:04,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:23:04,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:04,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:04,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,266 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,267 INFO L791 eck$LassoCheckResult]: Stem: 284#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 277#L196 assume 0 == ~r1~0; 228#L197 assume ~id1~0 >= 0; 215#L198 assume 0 == ~st1~0; 216#L199 assume ~send1~0 == ~id1~0; 269#L200 assume 0 == ~mode1~0 % 256; 270#L201 assume ~id2~0 >= 0; 251#L202 assume 0 == ~st2~0; 252#L203 assume ~send2~0 == ~id2~0; 258#L204 assume 0 == ~mode2~0 % 256; 231#L205 assume ~id3~0 >= 0; 232#L206 assume 0 == ~st3~0; 217#L207 assume ~send3~0 == ~id3~0; 218#L208 assume 0 == ~mode3~0 % 256; 274#L209 assume ~id4~0 >= 0; 233#L210 assume 0 == ~st4~0; 234#L211 assume ~send4~0 == ~id4~0; 219#L212 assume 0 == ~mode4~0 % 256; 220#L213 assume ~id5~0 >= 0; 287#L214 assume 0 == ~st5~0; 288#L215 assume ~send5~0 == ~id5~0; 271#L216 assume 0 == ~mode5~0 % 256; 254#L217 assume ~id1~0 != ~id2~0; 255#L218 assume ~id1~0 != ~id3~0; 278#L219 assume ~id1~0 != ~id4~0; 290#L220 assume ~id1~0 != ~id5~0; 246#L221 assume ~id2~0 != ~id3~0; 244#L222 assume ~id2~0 != ~id4~0; 245#L223 assume ~id2~0 != ~id5~0; 237#L224 assume ~id3~0 != ~id4~0; 238#L225 assume ~id3~0 != ~id5~0; 235#L226 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 236#L196-1 init_#res#1 := init_~tmp~0#1; 291#L321 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 279#L22 assume !(0 == assume_abort_if_not_~cond#1); 260#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 241#L393-2 [2021-12-15 17:23:04,267 INFO L793 eck$LassoCheckResult]: Loop: 241#L393-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 221#L71 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 222#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 259#L75-1 ~mode1~0 := 0; 211#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 226#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 227#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 224#L100-1 ~mode2~0 := 0; 225#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 282#L122 assume !(0 != ~mode3~0 % 256); 272#L135 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 273#L135-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 256#L122-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 275#L147 assume !(0 != ~mode4~0 % 256); 257#L160 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 239#L160-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 230#L147-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 247#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 212#L175 assume !(node5_~m5~0#1 != ~nomsg~0); 213#L175-1 ~mode5~0 := 0; 281#L172-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 267#L329 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 265#L329-1 check_#res#1 := check_~tmp~1#1; 248#L349 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 249#L423 assume !(0 == assert_~arg#1 % 256); 240#L418 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 241#L393-2 [2021-12-15 17:23:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2021-12-15 17:23:04,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044753853] [2021-12-15 17:23:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash 909200934, now seen corresponding path program 1 times [2021-12-15 17:23:04,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113040727] [2021-12-15 17:23:04,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:04,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:04,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113040727] [2021-12-15 17:23:04,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113040727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:04,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:04,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:04,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066888368] [2021-12-15 17:23:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:04,371 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:04,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:04,372 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:04,400 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2021-12-15 17:23:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:04,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2021-12-15 17:23:04,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:23:04,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2021-12-15 17:23:04,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-12-15 17:23:04,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-12-15 17:23:04,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2021-12-15 17:23:04,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:04,404 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-15 17:23:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2021-12-15 17:23:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-15 17:23:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-12-15 17:23:04,408 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-15 17:23:04,408 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-12-15 17:23:04,408 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:04,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2021-12-15 17:23:04,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:23:04,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:04,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:04,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,410 INFO L791 eck$LassoCheckResult]: Stem: 473#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 466#L196 assume 0 == ~r1~0; 417#L197 assume ~id1~0 >= 0; 404#L198 assume 0 == ~st1~0; 405#L199 assume ~send1~0 == ~id1~0; 458#L200 assume 0 == ~mode1~0 % 256; 459#L201 assume ~id2~0 >= 0; 439#L202 assume 0 == ~st2~0; 440#L203 assume ~send2~0 == ~id2~0; 447#L204 assume 0 == ~mode2~0 % 256; 418#L205 assume ~id3~0 >= 0; 419#L206 assume 0 == ~st3~0; 406#L207 assume ~send3~0 == ~id3~0; 407#L208 assume 0 == ~mode3~0 % 256; 463#L209 assume ~id4~0 >= 0; 422#L210 assume 0 == ~st4~0; 423#L211 assume ~send4~0 == ~id4~0; 408#L212 assume 0 == ~mode4~0 % 256; 409#L213 assume ~id5~0 >= 0; 476#L214 assume 0 == ~st5~0; 477#L215 assume ~send5~0 == ~id5~0; 460#L216 assume 0 == ~mode5~0 % 256; 443#L217 assume ~id1~0 != ~id2~0; 444#L218 assume ~id1~0 != ~id3~0; 467#L219 assume ~id1~0 != ~id4~0; 479#L220 assume ~id1~0 != ~id5~0; 435#L221 assume ~id2~0 != ~id3~0; 433#L222 assume ~id2~0 != ~id4~0; 434#L223 assume ~id2~0 != ~id5~0; 426#L224 assume ~id3~0 != ~id4~0; 427#L225 assume ~id3~0 != ~id5~0; 424#L226 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 425#L196-1 init_#res#1 := init_~tmp~0#1; 480#L321 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 468#L22 assume !(0 == assume_abort_if_not_~cond#1); 449#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 430#L393-2 [2021-12-15 17:23:04,410 INFO L793 eck$LassoCheckResult]: Loop: 430#L393-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 410#L71 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 411#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 448#L75-1 ~mode1~0 := 0; 400#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 415#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 416#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 413#L100-1 ~mode2~0 := 0; 414#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 471#L122 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 442#L125 assume !(node3_~m3~0#1 != ~nomsg~0); 397#L125-1 ~mode3~0 := 0; 445#L122-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 464#L147 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 450#L150 assume !(node4_~m4~0#1 != ~nomsg~0); 420#L150-1 ~mode4~0 := 0; 421#L147-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 438#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 401#L175 assume !(node5_~m5~0#1 != ~nomsg~0); 402#L175-1 ~mode5~0 := 0; 470#L172-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 456#L329 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 457#L330 assume ~r1~0 >= 5; 453#L334 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 454#L329-1 check_#res#1 := check_~tmp~1#1; 436#L349 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 437#L423 assume !(0 == assert_~arg#1 % 256); 429#L418 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 430#L393-2 [2021-12-15 17:23:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2021-12-15 17:23:04,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865422361] [2021-12-15 17:23:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1050477610, now seen corresponding path program 1 times [2021-12-15 17:23:04,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214866511] [2021-12-15 17:23:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:04,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:04,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214866511] [2021-12-15 17:23:04,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214866511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:04,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:04,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:04,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311151903] [2021-12-15 17:23:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:04,461 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:04,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:04,462 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:04,476 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2021-12-15 17:23:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:04,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2021-12-15 17:23:04,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:23:04,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2021-12-15 17:23:04,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:23:04,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:23:04,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2021-12-15 17:23:04,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:04,499 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-15 17:23:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2021-12-15 17:23:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:23:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2021-12-15 17:23:04,504 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-15 17:23:04,504 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-12-15 17:23:04,504 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:04,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2021-12-15 17:23:04,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:23:04,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:04,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:04,506 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,506 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:04,506 INFO L791 eck$LassoCheckResult]: Stem: 699#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 690#L196 assume 0 == ~r1~0; 641#L197 assume ~id1~0 >= 0; 628#L198 assume 0 == ~st1~0; 629#L199 assume ~send1~0 == ~id1~0; 682#L200 assume 0 == ~mode1~0 % 256; 683#L201 assume ~id2~0 >= 0; 664#L202 assume 0 == ~st2~0; 665#L203 assume ~send2~0 == ~id2~0; 672#L204 assume 0 == ~mode2~0 % 256; 644#L205 assume ~id3~0 >= 0; 645#L206 assume 0 == ~st3~0; 630#L207 assume ~send3~0 == ~id3~0; 631#L208 assume 0 == ~mode3~0 % 256; 687#L209 assume ~id4~0 >= 0; 646#L210 assume 0 == ~st4~0; 647#L211 assume ~send4~0 == ~id4~0; 637#L212 assume 0 == ~mode4~0 % 256; 638#L213 assume ~id5~0 >= 0; 703#L214 assume 0 == ~st5~0; 704#L215 assume ~send5~0 == ~id5~0; 686#L216 assume 0 == ~mode5~0 % 256; 668#L217 assume ~id1~0 != ~id2~0; 669#L218 assume ~id1~0 != ~id3~0; 691#L219 assume ~id1~0 != ~id4~0; 708#L220 assume ~id1~0 != ~id5~0; 659#L221 assume ~id2~0 != ~id3~0; 657#L222 assume ~id2~0 != ~id4~0; 658#L223 assume ~id2~0 != ~id5~0; 650#L224 assume ~id3~0 != ~id4~0; 651#L225 assume ~id3~0 != ~id5~0; 648#L226 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 649#L196-1 init_#res#1 := init_~tmp~0#1; 709#L321 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 692#L22 assume !(0 == assume_abort_if_not_~cond#1); 674#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 654#L393-2 [2021-12-15 17:23:04,507 INFO L793 eck$LassoCheckResult]: Loop: 654#L393-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 632#L71 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 633#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 673#L75-1 ~mode1~0 := 0; 624#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 639#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 640#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 635#L100-1 ~mode2~0 := 0; 636#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 695#L122 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 666#L125 assume !(node3_~m3~0#1 != ~nomsg~0); 621#L125-1 ~mode3~0 := 0; 667#L122-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 688#L147 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 675#L150 assume !(node4_~m4~0#1 != ~nomsg~0); 642#L150-1 ~mode4~0 := 0; 643#L147-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 660#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 625#L175 assume !(node5_~m5~0#1 != ~nomsg~0); 626#L175-1 ~mode5~0 := 0; 694#L172-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 701#L329 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 710#L330 assume !(~r1~0 >= 5); 706#L333 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 707#L334 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 698#L329-1 check_#res#1 := check_~tmp~1#1; 661#L349 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 662#L423 assume !(0 == assert_~arg#1 % 256); 653#L418 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 654#L393-2 [2021-12-15 17:23:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2021-12-15 17:23:04,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371451957] [2021-12-15 17:23:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -148360473, now seen corresponding path program 1 times [2021-12-15 17:23:04,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077667244] [2021-12-15 17:23:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:04,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1947490379, now seen corresponding path program 1 times [2021-12-15 17:23:04,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824538389] [2021-12-15 17:23:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:04,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:04,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824538389] [2021-12-15 17:23:04,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824538389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:04,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:04,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:04,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600073810] [2021-12-15 17:23:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:05,428 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:23:05,431 INFO L158 Benchmark]: Toolchain (without parser) took 2724.72ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 65.7MB in the beginning and 72.9MB in the end (delta: -7.2MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,431 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:05,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.26ms. Allocated memory is still 98.6MB. Free memory was 65.6MB in the beginning and 51.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.59ms. Allocated memory is still 98.6MB. Free memory was 51.6MB in the beginning and 49.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,432 INFO L158 Benchmark]: Boogie Preprocessor took 43.74ms. Allocated memory is still 98.6MB. Free memory was 49.1MB in the beginning and 47.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,432 INFO L158 Benchmark]: RCFGBuilder took 468.09ms. Allocated memory is still 98.6MB. Free memory was 47.2MB in the beginning and 65.8MB in the end (delta: -18.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,433 INFO L158 Benchmark]: BuchiAutomizer took 1899.12ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 65.8MB in the beginning and 72.9MB in the end (delta: -7.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:05,435 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.14ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.26ms. Allocated memory is still 98.6MB. Free memory was 65.6MB in the beginning and 51.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.59ms. Allocated memory is still 98.6MB. Free memory was 51.6MB in the beginning and 49.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.74ms. Allocated memory is still 98.6MB. Free memory was 49.1MB in the beginning and 47.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.09ms. Allocated memory is still 98.6MB. Free memory was 47.2MB in the beginning and 65.8MB in the end (delta: -18.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1899.12ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 65.8MB in the beginning and 72.9MB in the end (delta: -7.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:23:05,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable