./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.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.1.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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:18,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:18,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:18,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:18,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:18,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:18,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:18,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:18,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:18,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:18,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:18,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:18,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:18,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:18,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:18,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:18,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:18,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:18,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:18,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:18,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:18,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:18,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:18,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:18,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:18,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:18,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:18,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:18,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:18,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:18,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:18,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:18,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:18,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:18,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:18,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:18,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:18,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:18,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:18,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:18,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:18,929 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:18,963 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:18,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:18,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:18,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:18,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:18,965 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:18,965 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:18,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:18,966 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:18,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:18,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:18,967 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:18,968 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:18,968 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2021-12-15 17:22:19,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:19,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:19,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:19,202 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:19,206 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:19,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:19,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdbadf3f/d0dc3458b45a460084f80fa5fef5057e/FLAGc1bba9a97 [2021-12-15 17:22:19,649 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:19,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:19,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdbadf3f/d0dc3458b45a460084f80fa5fef5057e/FLAGc1bba9a97 [2021-12-15 17:22:19,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdbadf3f/d0dc3458b45a460084f80fa5fef5057e [2021-12-15 17:22:19,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:19,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:19,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:19,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:19,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:19,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:19" (1/1) ... [2021-12-15 17:22:19,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207725fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:19, skipping insertion in model container [2021-12-15 17:22:19,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:19" (1/1) ... [2021-12-15 17:22:19,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:19,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:19,985 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.1.ufo.UNBOUNDED.pals.c[11552,11565] [2021-12-15 17:22:19,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:19,993 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:20,056 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.1.ufo.UNBOUNDED.pals.c[11552,11565] [2021-12-15 17:22:20,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:20,079 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:20,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:20 WrapperNode [2021-12-15 17:22:20,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:20,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:20,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:20,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:20,086 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:20" (1/1) ... [2021-12-15 17:22:20,105 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:20" (1/1) ... [2021-12-15 17:22:20,144 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 414 [2021-12-15 17:22:20,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:20,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:20,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:20,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:20,156 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:20" (1/1) ... [2021-12-15 17:22:20,157 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:20" (1/1) ... [2021-12-15 17:22:20,163 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:20" (1/1) ... [2021-12-15 17:22:20,164 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:20" (1/1) ... [2021-12-15 17:22:20,171 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:20" (1/1) ... [2021-12-15 17:22:20,183 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:20" (1/1) ... [2021-12-15 17:22:20,187 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:20" (1/1) ... [2021-12-15 17:22:20,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:20,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:20,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:20,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:20,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:20" (1/1) ... [2021-12-15 17:22:20,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:20,261 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:20,300 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:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:20,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:20,398 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:20,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:20,812 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:20,819 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:20,819 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:20,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:20 BoogieIcfgContainer [2021-12-15 17:22:20,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:20,826 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:20,826 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:20,829 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:20,830 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:19" (1/3) ... [2021-12-15 17:22:20,832 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28816510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:20, skipping insertion in model container [2021-12-15 17:22:20,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:20" (2/3) ... [2021-12-15 17:22:20,832 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28816510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:20, skipping insertion in model container [2021-12-15 17:22:20,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:20" (3/3) ... [2021-12-15 17:22:20,834 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:20,906 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:20,907 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:20,907 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:20,907 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:20,908 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:20,908 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:20,908 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:20,908 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:20,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.7286821705426356) internal successors, (223), 129 states have internal predecessors, (223), 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:20,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:20,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:20,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:20,978 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:20,979 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:20,979 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:20,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.7286821705426356) internal successors, (223), 129 states have internal predecessors, (223), 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:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2021-12-15 17:22:20,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:20,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:20,999 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:21,000 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:21,007 INFO L791 eck$LassoCheckResult]: Stem: 116#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; 41#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#L241true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 28#L244-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 52#L254true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 55#L257-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 26#L267true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 13#L270-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 93#L280true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 73#L283-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 115#L293true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 72#L296-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 126#L306true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 19#L309-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 132#L319true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 101#L319-1true init_#res#1 := init_~tmp___5~0#1; 112#L404true 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;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; 42#L22true assume !(0 == assume_abort_if_not_~cond#1); 95#L21true assume { :end_inline_assume_abort_if_not } true;~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; 21#L512-2true [2021-12-15 17:22:21,019 INFO L793 eck$LassoCheckResult]: Loop: 21#L512-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 53#L79true assume !(0 != ~mode1~0 % 256); 123#L107true assume !(~r1~0 % 256 < 2); 117#L107-1true ~mode1~0 := 1; 39#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 88#L125true assume !(0 != ~mode2~0 % 256); 8#L153true assume !(~r2~0 % 256 < 2); 84#L153-1true ~mode2~0 := 1; 76#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 106#L171true assume !(0 != ~mode3~0 % 256); 47#L199true assume !(~r3~0 % 256 < 2); 131#L199-1true ~mode3~0 := 1; 80#L171-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; 57#L412true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 90#L412-1true check_#res#1 := check_~tmp~1#1; 60#L460true 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; 79#L541true assume !(0 == assert_~arg#1 % 256); 68#L536true assume { :end_inline_assert } true; 21#L512-2true [2021-12-15 17:22:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2021-12-15 17:22:21,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541914724] [2021-12-15 17:22:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,266 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:21,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541914724] [2021-12-15 17:22:21,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541914724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:21,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912509034] [2021-12-15 17:22:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,273 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1617526140, now seen corresponding path program 1 times [2021-12-15 17:22:21,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618716636] [2021-12-15 17:22:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,392 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:21,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618716636] [2021-12-15 17:22:21,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618716636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:21,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348581841] [2021-12-15 17:22:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,396 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:21,421 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.7286821705426356) internal successors, (223), 129 states have internal predecessors, (223), 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:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,507 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2021-12-15 17:22:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:21,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2021-12-15 17:22:21,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:21,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 207 transitions. [2021-12-15 17:22:21,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:22:21,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:22:21,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 207 transitions. [2021-12-15 17:22:21,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,524 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 207 transitions. [2021-12-15 17:22:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 207 transitions. [2021-12-15 17:22:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:22:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.656) internal successors, (207), 124 states have internal predecessors, (207), 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:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 207 transitions. [2021-12-15 17:22:21,550 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 207 transitions. [2021-12-15 17:22:21,550 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 207 transitions. [2021-12-15 17:22:21,550 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:21,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 207 transitions. [2021-12-15 17:22:21,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:21,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,554 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:21,554 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:21,555 INFO L791 eck$LassoCheckResult]: Stem: 401#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; 342#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; 328#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 286#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 325#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 332#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 321#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 292#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 299#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 374#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 383#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 334#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 382#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 306#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 307#L319 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 282#L319-1 init_#res#1 := init_~tmp___5~0#1; 396#L404 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;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; 343#L22 assume !(0 == assume_abort_if_not_~cond#1); 344#L21 assume { :end_inline_assume_abort_if_not } true;~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; 309#L512-2 [2021-12-15 17:22:21,555 INFO L793 eck$LassoCheckResult]: Loop: 309#L512-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 310#L79 assume !(0 != ~mode1~0 % 256); 359#L107 assume !(~r1~0 % 256 < 2); 393#L107-1 ~mode1~0 := 1; 338#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 339#L125 assume !(0 != ~mode2~0 % 256); 288#L153 assume !(~r2~0 % 256 < 2); 289#L153-1 ~mode2~0 := 1; 284#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 386#L171 assume !(0 != ~mode3~0 % 256); 349#L199 assume !(~r3~0 % 256 < 2); 350#L199-1 ~mode3~0 := 1; 372#L171-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; 364#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 365#L413 assume ~st1~0 + ~nl1~0 <= 1; 402#L414 assume ~st2~0 + ~nl2~0 <= 1; 398#L415 assume ~st3~0 + ~nl3~0 <= 1; 305#L416 assume ~r1~0 % 256 >= 2; 279#L420 assume ~r1~0 % 256 < 2; 340#L425 assume ~r1~0 % 256 >= 2; 301#L430 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 302#L412-1 check_#res#1 := check_~tmp~1#1; 369#L460 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; 370#L541 assume !(0 == assert_~arg#1 % 256); 379#L536 assume { :end_inline_assert } true; 309#L512-2 [2021-12-15 17:22:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2021-12-15 17:22:21,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263382759] [2021-12-15 17:22:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,623 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:21,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263382759] [2021-12-15 17:22:21,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263382759] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:21,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948845260] [2021-12-15 17:22:21,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,628 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -813850848, now seen corresponding path program 1 times [2021-12-15 17:22:21,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977446917] [2021-12-15 17:22:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,693 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:21,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977446917] [2021-12-15 17:22:21,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977446917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:21,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920477411] [2021-12-15 17:22:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:21,709 INFO L87 Difference]: Start difference. First operand 125 states and 207 transitions. cyclomatic complexity: 83 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:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,749 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2021-12-15 17:22:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:21,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 209 transitions. [2021-12-15 17:22:21,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:21,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 125 states and 186 transitions. [2021-12-15 17:22:21,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:22:21,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:22:21,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 186 transitions. [2021-12-15 17:22:21,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,756 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 186 transitions. [2021-12-15 17:22:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 186 transitions. [2021-12-15 17:22:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:22:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.488) internal successors, (186), 124 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 186 transitions. [2021-12-15 17:22:21,774 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 186 transitions. [2021-12-15 17:22:21,774 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 186 transitions. [2021-12-15 17:22:21,774 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:21,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 186 transitions. [2021-12-15 17:22:21,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2021-12-15 17:22:21,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,775 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] [2021-12-15 17:22:21,775 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:21,776 INFO L791 eck$LassoCheckResult]: Stem: 667#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; 607#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; 595#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 551#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 590#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 597#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 589#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 557#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 564#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 639#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 648#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 599#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 647#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 571#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 572#L319 assume ~id1~0 != ~id2~0; 653#L320 assume ~id1~0 != ~id3~0; 642#L321 assume ~id2~0 != ~id3~0; 643#L322 assume ~id1~0 >= 0; 546#L323 assume ~id2~0 >= 0; 547#L324 assume ~id3~0 >= 0; 569#L325 assume 0 == ~r1~0 % 256; 592#L326 assume 0 == ~r2~0 % 256; 574#L327 assume 0 == ~r3~0 % 256; 575#L328 assume ~max1~0 == ~id1~0; 601#L329 assume ~max2~0 == ~id2~0; 602#L330 assume ~max3~0 == ~id3~0; 561#L331 assume 0 == ~st1~0; 562#L332 assume 0 == ~st2~0; 591#L333 assume 0 == ~st3~0; 600#L334 assume 0 == ~nl1~0; 581#L335 assume 0 == ~nl2~0; 582#L336 assume 0 == ~nl3~0; 650#L337 assume 0 == ~mode1~0 % 256; 617#L338 assume 0 == ~mode2~0 % 256; 618#L339 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 661#L319-1 init_#res#1 := init_~tmp___5~0#1; 662#L404 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;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; 608#L22 assume !(0 == assume_abort_if_not_~cond#1); 609#L21 assume { :end_inline_assume_abort_if_not } true;~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; 576#L512-2 [2021-12-15 17:22:21,776 INFO L793 eck$LassoCheckResult]: Loop: 576#L512-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 577#L79 assume !(0 != ~mode1~0 % 256); 624#L107 assume !(~r1~0 % 256 < 2); 658#L107-1 ~mode1~0 := 1; 603#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 604#L125 assume !(0 != ~mode2~0 % 256); 553#L153 assume !(~r2~0 % 256 < 2); 554#L153-1 ~mode2~0 := 1; 549#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 651#L171 assume !(0 != ~mode3~0 % 256); 614#L199 assume !(~r3~0 % 256 < 2); 615#L199-1 ~mode3~0 := 1; 637#L171-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; 629#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 630#L413 assume ~st1~0 + ~nl1~0 <= 1; 668#L414 assume ~st2~0 + ~nl2~0 <= 1; 664#L415 assume ~st3~0 + ~nl3~0 <= 1; 570#L416 assume ~r1~0 % 256 >= 2; 545#L420 assume ~r1~0 % 256 < 2; 605#L425 assume ~r1~0 % 256 >= 2; 566#L430 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 567#L412-1 check_#res#1 := check_~tmp~1#1; 635#L460 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; 636#L541 assume !(0 == assert_~arg#1 % 256); 644#L536 assume { :end_inline_assert } true; 576#L512-2 [2021-12-15 17:22:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2021-12-15 17:22:21,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145893845] [2021-12-15 17:22:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,858 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -813850848, now seen corresponding path program 2 times [2021-12-15 17:22:21,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848652648] [2021-12-15 17:22:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,885 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:21,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848652648] [2021-12-15 17:22:21,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848652648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:21,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156839656] [2021-12-15 17:22:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:21,892 INFO L87 Difference]: Start difference. First operand 125 states and 186 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:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,940 INFO L93 Difference]: Finished difference Result 183 states and 272 transitions. [2021-12-15 17:22:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:21,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 272 transitions. [2021-12-15 17:22:21,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 132 [2021-12-15 17:22:21,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 272 transitions. [2021-12-15 17:22:21,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2021-12-15 17:22:21,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2021-12-15 17:22:21,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 272 transitions. [2021-12-15 17:22:21,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,950 INFO L681 BuchiCegarLoop]: Abstraction has 183 states and 272 transitions. [2021-12-15 17:22:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 272 transitions. [2021-12-15 17:22:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2021-12-15 17:22:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 181 states have (on average 1.4861878453038675) internal successors, (269), 180 states have internal predecessors, (269), 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:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 269 transitions. [2021-12-15 17:22:21,956 INFO L704 BuchiCegarLoop]: Abstraction has 181 states and 269 transitions. [2021-12-15 17:22:21,956 INFO L587 BuchiCegarLoop]: Abstraction has 181 states and 269 transitions. [2021-12-15 17:22:21,957 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:21,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 269 transitions. [2021-12-15 17:22:21,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2021-12-15 17:22:21,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,959 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] [2021-12-15 17:22:21,959 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:21,959 INFO L791 eck$LassoCheckResult]: Stem: 993#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; 921#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; 910#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 865#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 905#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 912#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 904#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 871#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 878#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 955#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 964#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 914#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 963#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 886#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 887#L319 assume ~id1~0 != ~id2~0; 971#L320 assume ~id1~0 != ~id3~0; 958#L321 assume ~id2~0 != ~id3~0; 959#L322 assume ~id1~0 >= 0; 860#L323 assume ~id2~0 >= 0; 861#L324 assume ~id3~0 >= 0; 882#L325 assume 0 == ~r1~0 % 256; 907#L326 assume 0 == ~r2~0 % 256; 891#L327 assume 0 == ~r3~0 % 256; 892#L328 assume ~max1~0 == ~id1~0; 916#L329 assume ~max2~0 == ~id2~0; 917#L330 assume ~max3~0 == ~id3~0; 875#L331 assume 0 == ~st1~0; 876#L332 assume 0 == ~st2~0; 906#L333 assume 0 == ~st3~0; 915#L334 assume 0 == ~nl1~0; 896#L335 assume 0 == ~nl2~0; 897#L336 assume 0 == ~nl3~0; 966#L337 assume 0 == ~mode1~0 % 256; 931#L338 assume 0 == ~mode2~0 % 256; 932#L339 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 984#L319-1 init_#res#1 := init_~tmp___5~0#1; 985#L404 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;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; 922#L22 assume !(0 == assume_abort_if_not_~cond#1); 923#L21 assume { :end_inline_assume_abort_if_not } true;~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#L512-2 [2021-12-15 17:22:21,959 INFO L793 eck$LassoCheckResult]: Loop: 981#L512-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1003#L79 assume !(0 != ~mode1~0 % 256); 1002#L107 assume ~r1~0 % 256 < 2; 893#L108 assume !(0 != ~ep12~0 % 256); 895#L108-2 assume !(0 != ~ep13~0 % 256); 979#L107-1 ~mode1~0 := 1; 918#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 919#L125 assume !(0 != ~mode2~0 % 256); 867#L153 assume !(~r2~0 % 256 < 2); 868#L153-1 ~mode2~0 := 1; 967#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 968#L171 assume !(0 != ~mode3~0 % 256); 928#L199 assume !(~r3~0 % 256 < 2); 929#L199-1 ~mode3~0 := 1; 953#L171-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; 944#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 945#L413 assume ~st1~0 + ~nl1~0 <= 1; 995#L414 assume ~st2~0 + ~nl2~0 <= 1; 999#L415 assume ~st3~0 + ~nl3~0 <= 1; 998#L416 assume !(~r1~0 % 256 >= 2); 858#L419 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 859#L420 assume ~r1~0 % 256 < 2; 1001#L425 assume !(~r1~0 % 256 >= 2); 969#L429 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 970#L430 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 1007#L412-1 check_#res#1 := check_~tmp~1#1; 1006#L460 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; 1005#L541 assume !(0 == assert_~arg#1 % 256); 1004#L536 assume { :end_inline_assert } true; 981#L512-2 [2021-12-15 17:22:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2021-12-15 17:22:21,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961682700] [2021-12-15 17:22:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:22,013 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1956837679, now seen corresponding path program 1 times [2021-12-15 17:22:22,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:22,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616579865] [2021-12-15 17:22:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:22,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:22,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:22,045 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 287698428, now seen corresponding path program 1 times [2021-12-15 17:22:22,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:22,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431661043] [2021-12-15 17:22:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:22,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:22,089 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:22,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:22,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431661043] [2021-12-15 17:22:22,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431661043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:22,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:22,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:22,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423154401] [2021-12-15 17:22:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:22,593 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:22,596 INFO L158 Benchmark]: Toolchain (without parser) took 2907.14ms. Allocated memory was 111.1MB in the beginning and 159.4MB in the end (delta: 48.2MB). Free memory was 82.6MB in the beginning and 125.1MB in the end (delta: -42.5MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,596 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory was 68.8MB in the beginning and 68.8MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:22,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.86ms. Allocated memory was 111.1MB in the beginning and 159.4MB in the end (delta: 48.2MB). Free memory was 82.6MB in the beginning and 130.1MB in the end (delta: -47.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.57ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 127.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,597 INFO L158 Benchmark]: Boogie Preprocessor took 44.52ms. Allocated memory is still 159.4MB. Free memory was 127.3MB in the beginning and 125.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,598 INFO L158 Benchmark]: RCFGBuilder took 630.13ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 102.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,598 INFO L158 Benchmark]: BuchiAutomizer took 1769.38ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 125.1MB in the end (delta: -23.0MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,601 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 111.1MB. Free memory was 68.8MB in the beginning and 68.8MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.86ms. Allocated memory was 111.1MB in the beginning and 159.4MB in the end (delta: 48.2MB). Free memory was 82.6MB in the beginning and 130.1MB in the end (delta: -47.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.57ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 127.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.52ms. Allocated memory is still 159.4MB. Free memory was 127.3MB in the beginning and 125.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.13ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 102.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1769.38ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 125.1MB in the end (delta: -23.0MB). Peak memory consumption was 54.9MB. 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:22,637 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