./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.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_floodmax.3.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc5c360927b8f961c81c15f32a759fd4b0c6971bec3efffa8564070a88946c3e --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:21,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:21,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:21,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:21,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:21,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:21,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:21,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:21,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:21,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:21,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:21,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:21,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:21,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:21,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:21,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:21,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:21,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:21,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:21,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:21,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:21,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:21,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:21,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:21,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:21,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:21,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:21,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:21,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:21,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:21,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:21,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:21,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:21,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:21,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:21,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:21,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:21,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:21,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:21,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:21,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:21,542 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:22:21,561 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:21,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:21,562 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:21,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:21,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:21,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:21,564 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:21,564 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:21,564 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:21,564 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:21,564 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:21,564 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:21,565 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:21,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:21,565 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:21,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:21,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:21,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:21,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:21,567 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:21,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:21,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:21,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:21,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:21,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:21,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:21,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:21,569 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:21,569 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 -> dc5c360927b8f961c81c15f32a759fd4b0c6971bec3efffa8564070a88946c3e [2021-12-15 17:22:21,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:21,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:21,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:21,787 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:21,788 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:21,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:21,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f882c4cc/1183e2170d744a58b4742d1be5e37b6e/FLAGe73715c30 [2021-12-15 17:22:22,231 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:22,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:22,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f882c4cc/1183e2170d744a58b4742d1be5e37b6e/FLAGe73715c30 [2021-12-15 17:22:22,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f882c4cc/1183e2170d744a58b4742d1be5e37b6e [2021-12-15 17:22:22,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:22,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:22,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:22,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:22,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:22,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365adb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22, skipping insertion in model container [2021-12-15 17:22:22,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:22,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:22,469 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_floodmax.3.2.ufo.UNBOUNDED.pals.c[12914,12927] [2021-12-15 17:22:22,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:22,479 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:22,530 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_floodmax.3.2.ufo.UNBOUNDED.pals.c[12914,12927] [2021-12-15 17:22:22,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:22,540 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:22,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22 WrapperNode [2021-12-15 17:22:22,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:22,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:22,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:22,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:22,549 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:22:22" (1/1) ... [2021-12-15 17:22:22,562 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:22:22" (1/1) ... [2021-12-15 17:22:22,593 INFO L137 Inliner]: procedures = 22, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2021-12-15 17:22:22,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:22,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:22,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:22,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:22,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:22,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:22,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:22,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:22,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (1/1) ... [2021-12-15 17:22:22,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:22,664 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:22:22,670 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:22:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:22,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:22,802 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:22,803 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:23,167 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:23,173 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:23,173 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:23,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:23 BoogieIcfgContainer [2021-12-15 17:22:23,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:23,175 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:23,175 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:23,178 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:23,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:23,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:22" (1/3) ... [2021-12-15 17:22:23,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20373955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:23, skipping insertion in model container [2021-12-15 17:22:23,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:23,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:22" (2/3) ... [2021-12-15 17:22:23,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20373955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:23, skipping insertion in model container [2021-12-15 17:22:23,180 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:23,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:23" (3/3) ... [2021-12-15 17:22:23,181 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:23,206 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:23,206 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:23,206 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:23,206 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:23,206 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:23,206 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:23,207 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:23,207 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:23,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 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:22:23,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:23,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:23,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:23,245 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,245 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,245 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:23,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 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:22:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:23,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:23,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:23,253 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,258 INFO L791 eck$LassoCheckResult]: Stem: 119#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 45#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 32#L238true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 133#L241-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 81#L251true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 12#L254-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 63#L264true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 42#L267-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 129#L277true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 41#L280-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 130#L290true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 102#L293-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 124#L303true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 115#L306-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 114#L316true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 82#L316-1true init_#res#1 := init_~tmp___5~0#1; 105#L425true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 85#L519true assume !(0 == main_~i2~0#1); 58#L519-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 125#L535-2true [2021-12-15 17:22:23,259 INFO L793 eck$LassoCheckResult]: Loop: 125#L535-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 70#L76true assume !(0 != ~mode1~0 % 256); 22#L104true assume !(~r1~0 % 256 < 2); 136#L104-1true ~mode1~0 := 1; 122#L76-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 53#L122true assume !(0 != ~mode2~0 % 256); 96#L150true assume !(~r2~0 % 256 < 2); 11#L150-1true ~mode2~0 := 1; 106#L122-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 9#L168true assume !(0 != ~mode3~0 % 256); 67#L196true assume !(~r3~0 % 256 < 2); 69#L196-1true ~mode3~0 := 1; 13#L168-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 73#L433true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 62#L433-1true check_#res#1 := check_~tmp~1#1; 31#L481true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 15#L564true assume !(0 == assert_~arg#1 % 256); 50#L559true assume { :end_inline_assert } true; 125#L535-2true [2021-12-15 17:22:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-12-15 17:22:23,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671679213] [2021-12-15 17:22:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:23,434 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:22:23,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:23,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671679213] [2021-12-15 17:22:23,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671679213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:23,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:23,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:23,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114460951] [2021-12-15 17:22:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:23,440 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash -912905468, now seen corresponding path program 1 times [2021-12-15 17:22:23,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194137496] [2021-12-15 17:22:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:23,539 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:22:23,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194137496] [2021-12-15 17:22:23,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194137496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:23,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:23,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:23,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551706237] [2021-12-15 17:22:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:23,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:23,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:23,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:23,563 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:23,631 INFO L93 Difference]: Finished difference Result 136 states and 231 transitions. [2021-12-15 17:22:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:23,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 231 transitions. [2021-12-15 17:22:23,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:23,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 131 states and 219 transitions. [2021-12-15 17:22:23,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:22:23,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:22:23,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 219 transitions. [2021-12-15 17:22:23,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:23,655 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 219 transitions. [2021-12-15 17:22:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:22:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 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:22:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 219 transitions. [2021-12-15 17:22:23,682 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:23,682 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:22:23,683 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:23,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 219 transitions. [2021-12-15 17:22:23,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:23,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:23,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:23,688 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,689 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,689 INFO L791 eck$LassoCheckResult]: Stem: 418#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 344#L238 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 345#L241-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 397#L251 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 311#L254-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 312#L264 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 335#L267-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 358#L277 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 320#L280-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 357#L290 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 411#L293-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 412#L303 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 396#L306-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 415#L316 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 297#L316-1 init_#res#1 := init_~tmp___5~0#1; 398#L425 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 401#L519 assume !(0 == main_~i2~0#1); 376#L519-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 365#L535-2 [2021-12-15 17:22:23,689 INFO L793 eck$LassoCheckResult]: Loop: 365#L535-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 389#L76 assume !(0 != ~mode1~0 % 256); 328#L104 assume !(~r1~0 % 256 < 2); 329#L104-1 ~mode1~0 := 1; 403#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 370#L122 assume !(0 != ~mode2~0 % 256); 371#L150 assume !(~r2~0 % 256 < 2); 309#L150-1 ~mode2~0 := 1; 310#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 306#L168 assume !(0 != ~mode3~0 % 256); 308#L196 assume !(~r3~0 % 256 < 2); 386#L196-1 ~mode3~0 := 1; 313#L168-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 314#L433 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 322#L434 assume ~st1~0 + ~nl1~0 <= 1; 323#L435 assume ~st2~0 + ~nl2~0 <= 1; 359#L436 assume ~st3~0 + ~nl3~0 <= 1; 300#L437 assume ~r1~0 % 256 >= 2; 301#L441 assume ~r1~0 % 256 < 2; 332#L446 assume ~r1~0 % 256 >= 2; 406#L451 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 294#L433-1 check_#res#1 := check_~tmp~1#1; 342#L481 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 317#L564 assume !(0 == assert_~arg#1 % 256); 318#L559 assume { :end_inline_assert } true; 365#L535-2 [2021-12-15 17:22:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-12-15 17:22:23,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325818392] [2021-12-15 17:22:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:23,769 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:22:23,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:23,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325818392] [2021-12-15 17:22:23,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325818392] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:23,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:23,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:23,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900860175] [2021-12-15 17:22:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:23,770 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1635620540, now seen corresponding path program 1 times [2021-12-15 17:22:23,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396104839] [2021-12-15 17:22:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:23,798 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:22:23,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:23,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396104839] [2021-12-15 17:22:23,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396104839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:23,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:23,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:23,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731518851] [2021-12-15 17:22:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:23,801 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:23,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:23,802 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:23,857 INFO L93 Difference]: Finished difference Result 134 states and 221 transitions. [2021-12-15 17:22:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:22:23,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 221 transitions. [2021-12-15 17:22:23,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:23,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 131 states and 192 transitions. [2021-12-15 17:22:23,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:22:23,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:22:23,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 192 transitions. [2021-12-15 17:22:23,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:23,862 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 192 transitions. [2021-12-15 17:22:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:22:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.465648854961832) internal successors, (192), 130 states have internal predecessors, (192), 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:22:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2021-12-15 17:22:23,867 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:23,867 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 192 transitions. [2021-12-15 17:22:23,867 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:23,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 192 transitions. [2021-12-15 17:22:23,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:23,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:23,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:23,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:23,870 INFO L791 eck$LassoCheckResult]: Stem: 696#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 638#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 621#L238 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 622#L241-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 675#L251 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 588#L254-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 589#L264 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 612#L267-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 636#L277 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 597#L280-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 635#L290 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 689#L293-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 690#L303 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 674#L306-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 693#L316 assume ~id1~0 != ~id2~0; 575#L317 assume ~id1~0 != ~id3~0; 576#L318 assume ~id2~0 != ~id3~0; 698#L319 assume ~id1~0 >= 0; 677#L320 assume ~id2~0 >= 0; 665#L321 assume ~id3~0 >= 0; 666#L322 assume 0 == ~r1~0 % 256; 573#L323 assume 0 == ~r2~0 % 256; 574#L324 assume 0 == ~r3~0 % 256; 598#L325 assume 0 != init_~r122~0#1 % 256; 625#L326 assume 0 != init_~r132~0#1 % 256; 607#L327 assume 0 != init_~r212~0#1 % 256; 608#L328 assume 0 != init_~r232~0#1 % 256; 631#L329 assume 0 != init_~r312~0#1 % 256; 632#L330 assume 0 != init_~r322~0#1 % 256; 592#L331 assume ~max1~0 == ~id1~0; 593#L332 assume ~max2~0 == ~id2~0; 624#L333 assume ~max3~0 == ~id3~0; 630#L334 assume 0 == ~st1~0; 615#L335 assume 0 == ~st2~0; 616#L336 assume 0 == ~st3~0; 672#L337 assume 0 == ~nl1~0; 651#L338 assume 0 == ~nl2~0; 652#L339 assume 0 == ~nl3~0; 688#L340 assume 0 == ~mode1~0 % 256; 682#L341 assume 0 == ~mode2~0 % 256; 633#L342 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 634#L316-1 init_#res#1 := init_~tmp___5~0#1; 676#L425 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 679#L519 assume !(0 == main_~i2~0#1); 655#L519-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 645#L535-2 [2021-12-15 17:22:23,870 INFO L793 eck$LassoCheckResult]: Loop: 645#L535-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 667#L76 assume !(0 != ~mode1~0 % 256); 605#L104 assume !(~r1~0 % 256 < 2); 606#L104-1 ~mode1~0 := 1; 681#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 648#L122 assume !(0 != ~mode2~0 % 256); 649#L150 assume !(~r2~0 % 256 < 2); 586#L150-1 ~mode2~0 := 1; 587#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 577#L168 assume !(0 != ~mode3~0 % 256); 579#L196 assume !(~r3~0 % 256 < 2); 664#L196-1 ~mode3~0 := 1; 590#L168-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 591#L433 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 599#L434 assume ~st1~0 + ~nl1~0 <= 1; 600#L435 assume ~st2~0 + ~nl2~0 <= 1; 637#L436 assume ~st3~0 + ~nl3~0 <= 1; 580#L437 assume ~r1~0 % 256 >= 2; 581#L441 assume ~r1~0 % 256 < 2; 609#L446 assume ~r1~0 % 256 >= 2; 685#L451 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 572#L433-1 check_#res#1 := check_~tmp~1#1; 619#L481 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 594#L564 assume !(0 == assert_~arg#1 % 256); 595#L559 assume { :end_inline_assert } true; 645#L535-2 [2021-12-15 17:22:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-12-15 17:22:23,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326593489] [2021-12-15 17:22:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:23,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:23,990 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1635620540, now seen corresponding path program 2 times [2021-12-15 17:22:23,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:23,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902441051] [2021-12-15 17:22:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:23,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:24,019 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:22:24,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:24,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902441051] [2021-12-15 17:22:24,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902441051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:24,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:24,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:24,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247863769] [2021-12-15 17:22:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:24,021 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:24,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:24,022 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:24,083 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2021-12-15 17:22:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:24,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 277 transitions. [2021-12-15 17:22:24,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2021-12-15 17:22:24,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 277 transitions. [2021-12-15 17:22:24,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2021-12-15 17:22:24,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2021-12-15 17:22:24,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 277 transitions. [2021-12-15 17:22:24,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:24,087 INFO L681 BuchiCegarLoop]: Abstraction has 188 states and 277 transitions. [2021-12-15 17:22:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 277 transitions. [2021-12-15 17:22:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-12-15 17:22:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.4731182795698925) internal successors, (274), 185 states have internal predecessors, (274), 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:22:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 274 transitions. [2021-12-15 17:22:24,094 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 274 transitions. [2021-12-15 17:22:24,094 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 274 transitions. [2021-12-15 17:22:24,094 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:24,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 274 transitions. [2021-12-15 17:22:24,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2021-12-15 17:22:24,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:24,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:24,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:24,097 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:22:24,097 INFO L791 eck$LassoCheckResult]: Stem: 1032#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 962#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 944#L238 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 945#L241-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1005#L251 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 912#L254-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 913#L264 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 935#L267-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 959#L277 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 921#L280-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 958#L290 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1021#L293-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1022#L303 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 1003#L306-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1029#L316 assume ~id1~0 != ~id2~0; 900#L317 assume ~id1~0 != ~id3~0; 901#L318 assume ~id2~0 != ~id3~0; 1036#L319 assume ~id1~0 >= 0; 1007#L320 assume ~id2~0 >= 0; 991#L321 assume ~id3~0 >= 0; 992#L322 assume 0 == ~r1~0 % 256; 898#L323 assume 0 == ~r2~0 % 256; 899#L324 assume 0 == ~r3~0 % 256; 922#L325 assume 0 != init_~r122~0#1 % 256; 948#L326 assume 0 != init_~r132~0#1 % 256; 931#L327 assume 0 != init_~r212~0#1 % 256; 932#L328 assume 0 != init_~r232~0#1 % 256; 954#L329 assume 0 != init_~r312~0#1 % 256; 955#L330 assume 0 != init_~r322~0#1 % 256; 916#L331 assume ~max1~0 == ~id1~0; 917#L332 assume ~max2~0 == ~id2~0; 947#L333 assume ~max3~0 == ~id3~0; 953#L334 assume 0 == ~st1~0; 938#L335 assume 0 == ~st2~0; 939#L336 assume 0 == ~st3~0; 1001#L337 assume 0 == ~nl1~0; 976#L338 assume 0 == ~nl2~0; 977#L339 assume 0 == ~nl3~0; 1020#L340 assume 0 == ~mode1~0 % 256; 1012#L341 assume 0 == ~mode2~0 % 256; 956#L342 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 957#L316-1 init_#res#1 := init_~tmp___5~0#1; 1006#L425 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 1009#L519 assume !(0 == main_~i2~0#1); 980#L519-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 981#L535-2 [2021-12-15 17:22:24,098 INFO L793 eck$LassoCheckResult]: Loop: 981#L535-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 993#L76 assume !(0 != ~mode1~0 % 256); 994#L104 assume ~r1~0 % 256 < 2; 926#L105 assume !(0 != ~ep12~0 % 256); 927#L105-2 assume !(0 != ~ep13~0 % 256); 963#L104-1 ~mode1~0 := 1; 1011#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1067#L122 assume !(0 != ~mode2~0 % 256); 1063#L150 assume !(~r2~0 % 256 < 2); 1059#L150-1 ~mode2~0 := 1; 1051#L122-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1049#L168 assume !(0 != ~mode3~0 % 256); 1046#L196 assume !(~r3~0 % 256 < 2); 1045#L196-1 ~mode3~0 := 1; 1043#L168-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1042#L433 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1041#L434 assume ~st1~0 + ~nl1~0 <= 1; 1040#L435 assume ~st2~0 + ~nl2~0 <= 1; 1039#L436 assume ~st3~0 + ~nl3~0 <= 1; 1038#L437 assume !(~r1~0 % 256 >= 2); 1017#L440 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1018#L441 assume ~r1~0 % 256 < 2; 1037#L446 assume !(~r1~0 % 256 >= 2); 1014#L450 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1015#L451 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 1078#L433-1 check_#res#1 := check_~tmp~1#1; 1077#L481 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 1076#L564 assume !(0 == assert_~arg#1 % 256); 1057#L559 assume { :end_inline_assert } true; 981#L535-2 [2021-12-15 17:22:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-12-15 17:22:24,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:24,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839261731] [2021-12-15 17:22:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:24,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:24,125 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:24,152 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1492715509, now seen corresponding path program 1 times [2021-12-15 17:22:24,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:24,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134148343] [2021-12-15 17:22:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:24,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:24,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:24,169 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1849804105, now seen corresponding path program 1 times [2021-12-15 17:22:24,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:24,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562163133] [2021-12-15 17:22:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:24,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:24,217 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:22:24,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:24,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562163133] [2021-12-15 17:22:24,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562163133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:24,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:24,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:24,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287925300] [2021-12-15 17:22:24,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:24,700 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:22:24,707 INFO L158 Benchmark]: Toolchain (without parser) took 2442.71ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.8MB in the beginning and 56.8MB in the end (delta: 5.0MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,708 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 48.1MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:24,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.08ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 65.3MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.17ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 62.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,709 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,711 INFO L158 Benchmark]: RCFGBuilder took 543.31ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 66.9MB in the end (delta: -6.7MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,712 INFO L158 Benchmark]: BuchiAutomizer took 1527.18ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 66.4MB in the beginning and 56.8MB in the end (delta: 9.5MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:24,714 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.16ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 48.1MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.08ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 65.3MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.17ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 62.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.31ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 66.9MB in the end (delta: -6.7MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1527.18ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 66.4MB in the beginning and 56.8MB in the end (delta: 9.5MB). Peak memory consumption was 42.3MB. 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:22:24,740 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 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