./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy2.cil.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 0f721563b23ef637d292551ef1a662f821e744b5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:31:41,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:31:41,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:31:41,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:31:41,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:31:41,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:31:41,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:31:41,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:31:41,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:31:41,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:31:41,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:31:41,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:31:41,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:31:41,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:31:41,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:31:41,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:31:41,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:31:41,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:31:41,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:31:41,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:31:41,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:31:41,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:31:41,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:31:41,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:31:41,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:31:41,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:31:41,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:31:41,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:31:41,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:31:41,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:31:41,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:31:41,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:31:41,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:31:41,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:31:41,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:31:41,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:31:41,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:31:41,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:31:41,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:31:41,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:31:41,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:31:41,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:31:41,948 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:31:41,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:31:41,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:31:41,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:31:41,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:31:41,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:31:41,951 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:31:41,951 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:31:41,952 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:31:41,952 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:31:41,952 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:31:41,952 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:31:41,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:31:41,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:31:41,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:31:41,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:31:41,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:31:41,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:31:41,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:31:41,955 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:31:41,956 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:31:41,956 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2021-08-27 16:31:42,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:31:42,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:31:42,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:31:42,202 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:31:42,202 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:31:42,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2021-08-27 16:31:42,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0559bb370/a993035dede244e6acd7e88d880e8655/FLAG86f5efa07 [2021-08-27 16:31:42,607 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:31:42,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2021-08-27 16:31:42,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0559bb370/a993035dede244e6acd7e88d880e8655/FLAG86f5efa07 [2021-08-27 16:31:42,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0559bb370/a993035dede244e6acd7e88d880e8655 [2021-08-27 16:31:42,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:31:42,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:31:42,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:31:42,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:31:42,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:31:42,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e424281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42, skipping insertion in model container [2021-08-27 16:31:42,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:31:42,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:31:42,788 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-08-27 16:31:42,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:31:42,843 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:31:42,885 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2021-08-27 16:31:42,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:31:42,913 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:31:42,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42 WrapperNode [2021-08-27 16:31:42,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:31:42,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:31:42,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:31:42,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:31:42,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:31:42,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:31:42,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:31:42,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:31:42,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:31:42,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:31:42,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:31:42,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:31:42,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (1/1) ... [2021-08-27 16:31:42,995 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:43,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:43,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:43,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 16:31:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:31:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:31:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:31:43,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:31:43,604 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:31:43,604 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-27 16:31:43,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:43 BoogieIcfgContainer [2021-08-27 16:31:43,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:31:43,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:31:43,608 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:31:43,610 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:31:43,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:43,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:31:42" (1/3) ... [2021-08-27 16:31:43,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d48951b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:31:43, skipping insertion in model container [2021-08-27 16:31:43,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:43,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:31:42" (2/3) ... [2021-08-27 16:31:43,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d48951b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:31:43, skipping insertion in model container [2021-08-27 16:31:43,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:31:43,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:43" (3/3) ... [2021-08-27 16:31:43,618 INFO L389 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2021-08-27 16:31:43,644 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:31:43,645 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:31:43,645 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:31:43,645 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:31:43,645 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:31:43,645 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:31:43,645 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:31:43,645 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:31:43,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.8699186991869918) internal successors, (230), 123 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:43,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-27 16:31:43,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:43,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:43,678 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] [2021-08-27 16:31:43,678 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] [2021-08-27 16:31:43,678 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:31:43,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.8699186991869918) internal successors, (230), 123 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-27 16:31:43,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:43,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:43,684 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] [2021-08-27 16:31:43,684 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] [2021-08-27 16:31:43,691 INFO L791 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 39#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 87#L396true assume !(1 == ~c_req_up~0); 25#L396-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 94#L407-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 88#L412-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 110#L417-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 59#L422-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 63#L427-1true assume !(0 == ~e_f~0); 72#L432-1true assume !(0 == ~e_g~0); 26#L437-1true assume !(0 == ~e_e~0); 38#L442-1true assume !(0 == ~e_c~0); 99#L447-1true assume !(0 == ~e_wl~0); 28#L452-1true assume !(1 == ~wl_pc~0); 103#L464true assume !(2 == ~wl_pc~0); 119#L465true assume !(1 == ~c1_pc~0); 70#L475true assume !(1 == ~c2_pc~0); 113#L484true assume !(1 == ~wb_pc~0); 9#L493true assume !(1 == ~e_c~0); 108#L502-1true assume !(1 == ~e_e~0); 16#L507-1true assume !(1 == ~e_f~0); 90#L512-1true assume !(1 == ~e_g~0); 19#L517-1true assume !(1 == ~e_c~0); 11#L522-1true assume !(1 == ~e_wl~0); 30#L664-1true [2021-08-27 16:31:43,692 INFO L793 eck$LassoCheckResult]: Loop: 30#L664-1true assume !false; 84#L534true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 32#L369true assume !true; 8#L385true start_simulation_~kernel_st~0 := 2; 22#L540true assume !(1 == ~c_req_up~0); 42#L540-2true start_simulation_~kernel_st~0 := 3; 40#L552true assume !(0 == ~e_f~0); 56#L552-2true assume 0 == ~e_g~0;~e_g~0 := 1; 79#L557-1true assume 0 == ~e_e~0;~e_e~0 := 1; 118#L562-1true assume 0 == ~e_c~0;~e_c~0 := 1; 85#L567-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 78#L572-1true assume !(1 == ~wl_pc~0); 53#L584true assume !(2 == ~wl_pc~0); 73#L585true assume !(1 == ~c1_pc~0); 125#L595true assume !(1 == ~c2_pc~0); 46#L604true assume !(1 == ~wb_pc~0); 37#L613true assume 1 == ~e_c~0;~r_st~0 := 0; 31#L622-1true assume !(1 == ~e_e~0); 92#L627-1true assume 1 == ~e_f~0;~e_f~0 := 2; 18#L632-1true assume 1 == ~e_g~0;~e_g~0 := 2; 64#L637-1true assume 1 == ~e_c~0;~e_c~0 := 2; 89#L642-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L647-1true assume 0 == ~wl_st~0; 30#L664-1true [2021-08-27 16:31:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-08-27 16:31:43,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:43,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141944983] [2021-08-27 16:31:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:43,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:43,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:43,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141944983] [2021-08-27 16:31:43,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141944983] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:43,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:43,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:43,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332230330] [2021-08-27 16:31:43,846 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 25607920, now seen corresponding path program 1 times [2021-08-27 16:31:43,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:43,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394226165] [2021-08-27 16:31:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:43,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:43,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:43,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394226165] [2021-08-27 16:31:43,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394226165] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:43,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:43,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:43,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048950853] [2021-08-27 16:31:43,864 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:43,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 16:31:43,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 16:31:43,875 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.8699186991869918) internal successors, (230), 123 states have internal predecessors, (230), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:43,884 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2021-08-27 16:31:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:31:43,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2021-08-27 16:31:43,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:43,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2021-08-27 16:31:43,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-08-27 16:31:43,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-08-27 16:31:43,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2021-08-27 16:31:43,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:43,893 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2021-08-27 16:31:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2021-08-27 16:31:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-27 16:31:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.781512605042017) internal successors, (212), 118 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2021-08-27 16:31:43,919 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2021-08-27 16:31:43,919 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2021-08-27 16:31:43,919 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:31:43,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2021-08-27 16:31:43,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:43,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:43,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:43,925 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] [2021-08-27 16:31:43,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:43,926 INFO L791 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 318#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 319#L396 assume !(1 == ~c_req_up~0); 271#L396-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 299#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 366#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 367#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 343#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 344#L427-1 assume !(0 == ~e_f~0); 348#L432-1 assume !(0 == ~e_g~0); 300#L437-1 assume !(0 == ~e_e~0); 301#L442-1 assume !(0 == ~e_c~0); 317#L447-1 assume !(0 == ~e_wl~0); 305#L452-1 assume !(1 == ~wl_pc~0); 306#L464 assume !(2 == ~wl_pc~0); 371#L465 assume !(1 == ~c1_pc~0); 323#L475 assume !(1 == ~c2_pc~0); 354#L484 assume !(1 == ~wb_pc~0); 268#L493 assume !(1 == ~e_c~0); 269#L502-1 assume !(1 == ~e_e~0); 282#L507-1 assume !(1 == ~e_f~0); 283#L512-1 assume !(1 == ~e_g~0); 287#L517-1 assume !(1 == ~e_c~0); 272#L522-1 assume !(1 == ~e_wl~0); 273#L664-1 [2021-08-27 16:31:43,926 INFO L793 eck$LassoCheckResult]: Loop: 273#L664-1 assume !false; 308#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 311#L369 assume !false; 312#L287 assume !(0 == ~wl_st~0); 347#L291 assume !(0 == ~c1_st~0); 356#L294 assume !(0 == ~c2_st~0); 302#L297 assume !(0 == ~wb_st~0); 304#L300 assume !(0 == ~r_st~0); 266#L385 start_simulation_~kernel_st~0 := 2; 267#L540 assume !(1 == ~c_req_up~0); 278#L540-2 start_simulation_~kernel_st~0 := 3; 320#L552 assume !(0 == ~e_f~0); 321#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 341#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 360#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 364#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 358#L572-1 assume 1 == ~wl_pc~0; 327#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 329#L585 assume !(1 == ~c1_pc~0); 325#L595 assume !(1 == ~c2_pc~0); 330#L604 assume !(1 == ~wb_pc~0); 315#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 309#L622-1 assume !(1 == ~e_e~0); 310#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 285#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 286#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 349#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 291#L647-1 assume 0 == ~wl_st~0; 273#L664-1 [2021-08-27 16:31:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-08-27 16:31:43,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:43,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3223226] [2021-08-27 16:31:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:43,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:43,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:43,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3223226] [2021-08-27 16:31:43,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3223226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:43,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:43,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:43,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132231681] [2021-08-27 16:31:43,968 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 1 times [2021-08-27 16:31:43,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:43,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661083781] [2021-08-27 16:31:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:43,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:43,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:43,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661083781] [2021-08-27 16:31:43,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661083781] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:43,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:43,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:43,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328060703] [2021-08-27 16:31:43,992 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:43,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:43,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:43,993 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,009 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2021-08-27 16:31:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:44,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2021-08-27 16:31:44,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2021-08-27 16:31:44,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-08-27 16:31:44,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-08-27 16:31:44,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2021-08-27 16:31:44,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:44,014 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2021-08-27 16:31:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2021-08-27 16:31:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-27 16:31:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.773109243697479) internal successors, (211), 118 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2021-08-27 16:31:44,018 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2021-08-27 16:31:44,018 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2021-08-27 16:31:44,019 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:31:44,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2021-08-27 16:31:44,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:44,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:44,020 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] [2021-08-27 16:31:44,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:44,021 INFO L791 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 563#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 564#L396 assume !(1 == ~c_req_up~0); 516#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 544#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 611#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 612#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 588#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 589#L427-1 assume !(0 == ~e_f~0); 593#L432-1 assume !(0 == ~e_g~0); 545#L437-1 assume !(0 == ~e_e~0); 546#L442-1 assume !(0 == ~e_c~0); 562#L447-1 assume !(0 == ~e_wl~0); 550#L452-1 assume !(1 == ~wl_pc~0); 551#L464 assume !(2 == ~wl_pc~0); 616#L465 assume !(1 == ~c1_pc~0); 568#L475 assume !(1 == ~c2_pc~0); 599#L484 assume !(1 == ~wb_pc~0); 513#L493 assume !(1 == ~e_c~0); 514#L502-1 assume !(1 == ~e_e~0); 527#L507-1 assume !(1 == ~e_f~0); 528#L512-1 assume !(1 == ~e_g~0); 532#L517-1 assume !(1 == ~e_c~0); 517#L522-1 assume !(1 == ~e_wl~0); 518#L664-1 [2021-08-27 16:31:44,021 INFO L793 eck$LassoCheckResult]: Loop: 518#L664-1 assume !false; 553#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 556#L369 assume !false; 557#L287 assume !(0 == ~wl_st~0); 592#L291 assume !(0 == ~c1_st~0); 601#L294 assume !(0 == ~c2_st~0); 547#L297 assume !(0 == ~wb_st~0); 549#L300 assume !(0 == ~r_st~0); 511#L385 start_simulation_~kernel_st~0 := 2; 512#L540 assume !(1 == ~c_req_up~0); 523#L540-2 start_simulation_~kernel_st~0 := 3; 565#L552 assume !(0 == ~e_f~0); 566#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 586#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 605#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 609#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 603#L572-1 assume 1 == ~wl_pc~0; 572#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 574#L585 assume !(1 == ~c1_pc~0); 570#L595 assume !(1 == ~c2_pc~0); 575#L604 assume !(1 == ~wb_pc~0); 560#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 554#L622-1 assume !(1 == ~e_e~0); 555#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 530#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 531#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 594#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 536#L647-1 assume 0 == ~wl_st~0; 518#L664-1 [2021-08-27 16:31:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-08-27 16:31:44,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541480367] [2021-08-27 16:31:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541480367] [2021-08-27 16:31:44,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541480367] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60578487] [2021-08-27 16:31:44,079 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 2 times [2021-08-27 16:31:44,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555320384] [2021-08-27 16:31:44,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555320384] [2021-08-27 16:31:44,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555320384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406812746] [2021-08-27 16:31:44,111 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:44,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:44,112 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,121 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2021-08-27 16:31:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:44,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2021-08-27 16:31:44,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2021-08-27 16:31:44,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-08-27 16:31:44,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-08-27 16:31:44,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2021-08-27 16:31:44,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:44,130 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2021-08-27 16:31:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2021-08-27 16:31:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-27 16:31:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 118 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2021-08-27 16:31:44,136 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2021-08-27 16:31:44,136 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2021-08-27 16:31:44,136 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:31:44,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2021-08-27 16:31:44,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:44,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:44,137 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] [2021-08-27 16:31:44,137 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:44,138 INFO L791 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 808#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 809#L396 assume !(1 == ~c_req_up~0); 761#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 789#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 856#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 857#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 833#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 834#L427-1 assume !(0 == ~e_f~0); 838#L432-1 assume !(0 == ~e_g~0); 790#L437-1 assume !(0 == ~e_e~0); 791#L442-1 assume !(0 == ~e_c~0); 807#L447-1 assume !(0 == ~e_wl~0); 795#L452-1 assume !(1 == ~wl_pc~0); 796#L464 assume !(2 == ~wl_pc~0); 861#L465 assume !(1 == ~c1_pc~0); 813#L475 assume !(1 == ~c2_pc~0); 844#L484 assume !(1 == ~wb_pc~0); 758#L493 assume !(1 == ~e_c~0); 759#L502-1 assume !(1 == ~e_e~0); 772#L507-1 assume !(1 == ~e_f~0); 773#L512-1 assume !(1 == ~e_g~0); 777#L517-1 assume !(1 == ~e_c~0); 762#L522-1 assume !(1 == ~e_wl~0); 763#L664-1 [2021-08-27 16:31:44,138 INFO L793 eck$LassoCheckResult]: Loop: 763#L664-1 assume !false; 798#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 801#L369 assume !false; 802#L287 assume !(0 == ~wl_st~0); 837#L291 assume !(0 == ~c1_st~0); 846#L294 assume !(0 == ~c2_st~0); 792#L297 assume !(0 == ~wb_st~0); 794#L300 assume !(0 == ~r_st~0); 756#L385 start_simulation_~kernel_st~0 := 2; 757#L540 assume !(1 == ~c_req_up~0); 768#L540-2 start_simulation_~kernel_st~0 := 3; 810#L552 assume !(0 == ~e_f~0); 811#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 831#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 850#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 854#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 848#L572-1 assume 1 == ~wl_pc~0; 817#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 819#L585 assume !(1 == ~c1_pc~0); 815#L595 assume !(1 == ~c2_pc~0); 820#L604 assume !(1 == ~wb_pc~0); 805#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 799#L622-1 assume !(1 == ~e_e~0); 800#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 775#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 776#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 839#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 781#L647-1 assume 0 == ~wl_st~0; 763#L664-1 [2021-08-27 16:31:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-08-27 16:31:44,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890699662] [2021-08-27 16:31:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890699662] [2021-08-27 16:31:44,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890699662] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083487913] [2021-08-27 16:31:44,164 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 3 times [2021-08-27 16:31:44,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757967493] [2021-08-27 16:31:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757967493] [2021-08-27 16:31:44,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757967493] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169298933] [2021-08-27 16:31:44,183 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:44,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:44,184 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,205 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2021-08-27 16:31:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:44,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2021-08-27 16:31:44,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2021-08-27 16:31:44,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-08-27 16:31:44,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-08-27 16:31:44,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2021-08-27 16:31:44,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:44,211 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2021-08-27 16:31:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2021-08-27 16:31:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-27 16:31:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 118 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2021-08-27 16:31:44,215 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2021-08-27 16:31:44,215 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2021-08-27 16:31:44,215 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:31:44,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2021-08-27 16:31:44,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2021-08-27 16:31:44,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:44,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:44,216 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] [2021-08-27 16:31:44,217 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:44,217 INFO L791 eck$LassoCheckResult]: Stem: 1110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1053#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1054#L396 assume !(1 == ~c_req_up~0); 1006#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1034#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1101#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1102#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1078#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1079#L427-1 assume !(0 == ~e_f~0); 1083#L432-1 assume !(0 == ~e_g~0); 1035#L437-1 assume !(0 == ~e_e~0); 1036#L442-1 assume !(0 == ~e_c~0); 1052#L447-1 assume !(0 == ~e_wl~0); 1040#L452-1 assume !(1 == ~wl_pc~0); 1041#L464 assume !(2 == ~wl_pc~0); 1106#L465 assume !(1 == ~c1_pc~0); 1058#L475 assume !(1 == ~c2_pc~0); 1089#L484 assume !(1 == ~wb_pc~0); 1003#L493 assume !(1 == ~e_c~0); 1004#L502-1 assume !(1 == ~e_e~0); 1017#L507-1 assume !(1 == ~e_f~0); 1018#L512-1 assume !(1 == ~e_g~0); 1022#L517-1 assume !(1 == ~e_c~0); 1007#L522-1 assume !(1 == ~e_wl~0); 1008#L664-1 [2021-08-27 16:31:44,217 INFO L793 eck$LassoCheckResult]: Loop: 1008#L664-1 assume !false; 1043#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1046#L369 assume !false; 1047#L287 assume !(0 == ~wl_st~0); 1082#L291 assume !(0 == ~c1_st~0); 1091#L294 assume !(0 == ~c2_st~0); 1037#L297 assume !(0 == ~wb_st~0); 1039#L300 assume !(0 == ~r_st~0); 1001#L385 start_simulation_~kernel_st~0 := 2; 1002#L540 assume !(1 == ~c_req_up~0); 1013#L540-2 start_simulation_~kernel_st~0 := 3; 1055#L552 assume !(0 == ~e_f~0); 1056#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1076#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1095#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1099#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1093#L572-1 assume 1 == ~wl_pc~0; 1062#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1064#L585 assume !(1 == ~c1_pc~0); 1060#L595 assume !(1 == ~c2_pc~0); 1065#L604 assume !(1 == ~wb_pc~0); 1050#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1044#L622-1 assume !(1 == ~e_e~0); 1045#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1020#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1021#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1084#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1026#L647-1 assume 0 == ~wl_st~0; 1008#L664-1 [2021-08-27 16:31:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-08-27 16:31:44,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604996112] [2021-08-27 16:31:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,229 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 4 times [2021-08-27 16:31:44,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308965335] [2021-08-27 16:31:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308965335] [2021-08-27 16:31:44,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308965335] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:44,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142815462] [2021-08-27 16:31:44,317 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:44,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:44,318 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:44,342 INFO L93 Difference]: Finished difference Result 147 states and 260 transitions. [2021-08-27 16:31:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:44,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 260 transitions. [2021-08-27 16:31:44,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2021-08-27 16:31:44,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 260 transitions. [2021-08-27 16:31:44,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2021-08-27 16:31:44,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2021-08-27 16:31:44,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 260 transitions. [2021-08-27 16:31:44,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:31:44,345 INFO L681 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2021-08-27 16:31:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 260 transitions. [2021-08-27 16:31:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-08-27 16:31:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.7687074829931972) internal successors, (260), 146 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2021-08-27 16:31:44,349 INFO L704 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2021-08-27 16:31:44,349 INFO L587 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2021-08-27 16:31:44,349 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:31:44,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 260 transitions. [2021-08-27 16:31:44,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2021-08-27 16:31:44,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:44,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:44,351 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] [2021-08-27 16:31:44,351 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:44,351 INFO L791 eck$LassoCheckResult]: Stem: 1385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1326#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1327#L396 assume !(1 == ~c_req_up~0); 1278#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1306#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1376#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1377#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1351#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1352#L427-1 assume !(0 == ~e_f~0); 1356#L432-1 assume !(0 == ~e_g~0); 1307#L437-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1308#L442-1 assume !(0 == ~e_c~0); 1410#L447-1 assume !(0 == ~e_wl~0); 1409#L452-1 assume !(1 == ~wl_pc~0); 1408#L464 assume !(2 == ~wl_pc~0); 1387#L465 assume !(1 == ~c1_pc~0); 1361#L475 assume !(1 == ~c2_pc~0); 1363#L484 assume !(1 == ~wb_pc~0); 1275#L493 assume !(1 == ~e_c~0); 1276#L502-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1289#L507-1 assume !(1 == ~e_f~0); 1290#L512-1 assume !(1 == ~e_g~0); 1294#L517-1 assume !(1 == ~e_c~0); 1279#L522-1 assume !(1 == ~e_wl~0); 1280#L664-1 [2021-08-27 16:31:44,351 INFO L793 eck$LassoCheckResult]: Loop: 1280#L664-1 assume !false; 1316#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1319#L369 assume !false; 1320#L287 assume !(0 == ~wl_st~0); 1355#L291 assume !(0 == ~c1_st~0); 1365#L294 assume !(0 == ~c2_st~0); 1310#L297 assume !(0 == ~wb_st~0); 1312#L300 assume !(0 == ~r_st~0); 1273#L385 start_simulation_~kernel_st~0 := 2; 1274#L540 assume !(1 == ~c_req_up~0); 1285#L540-2 start_simulation_~kernel_st~0 := 3; 1328#L552 assume !(0 == ~e_f~0); 1329#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1349#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1369#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1374#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1367#L572-1 assume 1 == ~wl_pc~0; 1335#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1337#L585 assume !(1 == ~c1_pc~0); 1333#L595 assume !(1 == ~c2_pc~0); 1338#L604 assume !(1 == ~wb_pc~0); 1323#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1317#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1318#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1292#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1293#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1357#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1298#L647-1 assume 0 == ~wl_st~0; 1280#L664-1 [2021-08-27 16:31:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1264875287, now seen corresponding path program 1 times [2021-08-27 16:31:44,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881212640] [2021-08-27 16:31:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:44,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:44,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881212640] [2021-08-27 16:31:44,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881212640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:44,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:44,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:44,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313548074] [2021-08-27 16:31:44,402 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2144825525, now seen corresponding path program 1 times [2021-08-27 16:31:44,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:44,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529936777] [2021-08-27 16:31:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:44,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,411 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:44,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:44,707 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:44,708 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:44,708 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:44,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:44,708 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:31:44,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:44,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:44,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:44,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2021-08-27 16:31:44,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:44,709 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:44,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:44,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,069 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:45,070 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:31:45,071 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:45,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:45,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 16:31:45,112 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:45,113 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:45,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 16:31:45,131 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 16:31:45,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:45,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:45,140 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:31:45,140 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:31:45,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 16:31:45,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:31:45,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:45,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 16:31:45,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:31:45,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:31:45,243 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:31:45,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,260 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:31:45,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:31:45,261 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:31:45,261 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:31:45,261 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:31:45,261 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,261 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:31:45,261 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:31:45,261 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2021-08-27 16:31:45,261 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:31:45,261 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:31:45,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:31:45,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:31:45,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:31:45,529 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 16:31:45,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:45,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:45,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:45,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:45,540 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:31:45,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:45,542 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:31:45,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:45,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:45,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,577 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 16:31:45,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:45,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:45,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:45,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:45,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:45,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:45,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:45,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:45,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:31:45,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,625 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 16:31:45,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:31:45,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:31:45,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:31:45,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:31:45,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:31:45,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:31:45,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:31:45,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:31:45,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:31:45,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:31:45,672 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:31:45,673 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:31:45,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:31:45,674 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:31:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 16:31:45,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:31:45,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:31:45,676 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:31:45,677 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2021-08-27 16:31:45,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-08-27 16:31:45,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:31:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:45,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:31:45,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:45,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 16:31:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:45,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:31:45,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:31:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,029 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:31:46,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 461 states and 811 transitions. Complement of second has 5 states. [2021-08-27 16:31:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 16:31:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2021-08-27 16:31:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 28 letters. [2021-08-27 16:31:46,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:46,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 52 letters. Loop has 28 letters. [2021-08-27 16:31:46,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:46,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 56 letters. [2021-08-27 16:31:46,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:31:46,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 811 transitions. [2021-08-27 16:31:46,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 306 [2021-08-27 16:31:46,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 811 transitions. [2021-08-27 16:31:46,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2021-08-27 16:31:46,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2021-08-27 16:31:46,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 811 transitions. [2021-08-27 16:31:46,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,124 INFO L681 BuchiCegarLoop]: Abstraction has 461 states and 811 transitions. [2021-08-27 16:31:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 811 transitions. [2021-08-27 16:31:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 355. [2021-08-27 16:31:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 355 states have (on average 1.763380281690141) internal successors, (626), 354 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 626 transitions. [2021-08-27 16:31:46,144 INFO L704 BuchiCegarLoop]: Abstraction has 355 states and 626 transitions. [2021-08-27 16:31:46,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,145 INFO L87 Difference]: Start difference. First operand 355 states and 626 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,226 INFO L93 Difference]: Finished difference Result 595 states and 1033 transitions. [2021-08-27 16:31:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:31:46,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 1033 transitions. [2021-08-27 16:31:46,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2021-08-27 16:31:46,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 1033 transitions. [2021-08-27 16:31:46,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2021-08-27 16:31:46,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2021-08-27 16:31:46,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 1033 transitions. [2021-08-27 16:31:46,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,233 INFO L681 BuchiCegarLoop]: Abstraction has 595 states and 1033 transitions. [2021-08-27 16:31:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1033 transitions. [2021-08-27 16:31:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 559. [2021-08-27 16:31:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 559 states have (on average 1.7459749552772807) internal successors, (976), 558 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 976 transitions. [2021-08-27 16:31:46,245 INFO L704 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2021-08-27 16:31:46,245 INFO L587 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2021-08-27 16:31:46,245 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 16:31:46,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 976 transitions. [2021-08-27 16:31:46,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2021-08-27 16:31:46,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,252 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] [2021-08-27 16:31:46,252 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,252 INFO L791 eck$LassoCheckResult]: Stem: 3250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3116#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3117#L396 assume !(1 == ~c_req_up~0); 3027#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3083#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3228#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3229#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3174#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3175#L427-1 assume !(0 == ~e_f~0); 3183#L432-1 assume !(0 == ~e_g~0); 3084#L437-1 assume !(0 == ~e_e~0); 3085#L442-1 assume !(0 == ~e_c~0); 3115#L447-1 assume !(0 == ~e_wl~0); 3092#L452-1 assume !(1 == ~wl_pc~0); 3093#L464 assume !(2 == ~wl_pc~0); 3241#L465 assume !(1 == ~c1_pc~0); 3280#L475 assume !(1 == ~c2_pc~0); 3278#L484 assume !(1 == ~wb_pc~0); 3276#L493 assume !(1 == ~e_c~0); 3274#L502-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3047#L507-1 assume !(1 == ~e_f~0); 3048#L512-1 assume !(1 == ~e_g~0); 3055#L517-1 assume !(1 == ~e_c~0); 3056#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3289#L664-1 [2021-08-27 16:31:46,252 INFO L793 eck$LassoCheckResult]: Loop: 3289#L664-1 assume !false; 3485#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3102#L369 assume !false; 3103#L287 assume !(0 == ~wl_st~0); 3180#L291 assume !(0 == ~c1_st~0); 3203#L294 assume !(0 == ~c2_st~0); 3086#L297 assume !(0 == ~wb_st~0); 3088#L300 assume !(0 == ~r_st~0); 3447#L385 start_simulation_~kernel_st~0 := 2; 3377#L540 assume !(1 == ~c_req_up~0); 3374#L540-2 start_simulation_~kernel_st~0 := 3; 3372#L552 assume !(0 == ~e_f~0); 3369#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3368#L557-1 assume !(0 == ~e_e~0); 3359#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3357#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3358#L572-1 assume !(1 == ~wl_pc~0); 3351#L584 assume !(2 == ~wl_pc~0); 3348#L585 assume !(1 == ~c1_pc~0); 3344#L595 assume !(1 == ~c2_pc~0); 3340#L604 assume !(1 == ~wb_pc~0); 3337#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 3335#L622-1 assume !(1 == ~e_e~0); 3334#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3333#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3332#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3230#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3231#L647-1 assume 0 == ~wl_st~0; 3289#L664-1 [2021-08-27 16:31:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash 253758035, now seen corresponding path program 1 times [2021-08-27 16:31:46,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646678518] [2021-08-27 16:31:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646678518] [2021-08-27 16:31:46,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646678518] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:46,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419954898] [2021-08-27 16:31:46,308 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 1 times [2021-08-27 16:31:46,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167856604] [2021-08-27 16:31:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167856604] [2021-08-27 16:31:46,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167856604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:46,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392544281] [2021-08-27 16:31:46,331 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:46,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,334 INFO L87 Difference]: Start difference. First operand 559 states and 976 transitions. cyclomatic complexity: 423 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,387 INFO L93 Difference]: Finished difference Result 1029 states and 1741 transitions. [2021-08-27 16:31:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:31:46,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1741 transitions. [2021-08-27 16:31:46,394 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2021-08-27 16:31:46,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 1029 states and 1741 transitions. [2021-08-27 16:31:46,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2021-08-27 16:31:46,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2021-08-27 16:31:46,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1029 states and 1741 transitions. [2021-08-27 16:31:46,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,401 INFO L681 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2021-08-27 16:31:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states and 1741 transitions. [2021-08-27 16:31:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2021-08-27 16:31:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1029 states have (on average 1.6919339164237124) internal successors, (1741), 1028 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1741 transitions. [2021-08-27 16:31:46,417 INFO L704 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2021-08-27 16:31:46,417 INFO L587 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2021-08-27 16:31:46,417 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 16:31:46,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1741 transitions. [2021-08-27 16:31:46,421 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2021-08-27 16:31:46,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,422 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] [2021-08-27 16:31:46,422 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,423 INFO L791 eck$LassoCheckResult]: Stem: 4872#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4719#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4720#L396 assume !(1 == ~c_req_up~0); 4626#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4848#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4849#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4871#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4772#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4773#L427-1 assume !(0 == ~e_f~0); 4785#L432-1 assume !(0 == ~e_g~0); 4801#L437-1 assume !(0 == ~e_e~0); 4896#L442-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4718#L447-1 assume !(0 == ~e_wl~0); 4694#L452-1 assume !(1 == ~wl_pc~0); 4695#L464 assume !(2 == ~wl_pc~0); 4894#L465 assume !(1 == ~c1_pc~0); 4892#L475 assume !(1 == ~c2_pc~0); 4873#L484 assume !(1 == ~wb_pc~0); 4804#L493 assume !(1 == ~e_c~0); 4889#L502-1 assume !(1 == ~e_e~0); 4646#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4647#L512-1 assume !(1 == ~e_g~0); 4656#L517-1 assume !(1 == ~e_c~0); 4627#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4628#L664-1 [2021-08-27 16:31:46,423 INFO L793 eck$LassoCheckResult]: Loop: 4628#L664-1 assume !false; 5503#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 5187#L369 assume !false; 5501#L287 assume !(0 == ~wl_st~0); 5500#L291 assume !(0 == ~c1_st~0); 5499#L294 assume !(0 == ~c2_st~0); 5498#L297 assume !(0 == ~wb_st~0); 5146#L300 assume !(0 == ~r_st~0); 5141#L385 start_simulation_~kernel_st~0 := 2; 5142#L540 assume !(1 == ~c_req_up~0); 5481#L540-2 start_simulation_~kernel_st~0 := 3; 5480#L552 assume !(0 == ~e_f~0); 5479#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 5476#L557-1 assume !(0 == ~e_e~0); 5116#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5117#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5475#L572-1 assume !(1 == ~wl_pc~0); 5462#L584 assume !(2 == ~wl_pc~0); 5455#L585 assume !(1 == ~c1_pc~0); 5449#L595 assume !(1 == ~c2_pc~0); 5443#L604 assume !(1 == ~wb_pc~0); 5438#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 5435#L622-1 assume !(1 == ~e_e~0); 5428#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5426#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5423#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 5424#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5549#L647-1 assume 0 == ~wl_st~0; 4628#L664-1 [2021-08-27 16:31:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 842351509, now seen corresponding path program 1 times [2021-08-27 16:31:46,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012900389] [2021-08-27 16:31:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012900389] [2021-08-27 16:31:46,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012900389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:46,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101378015] [2021-08-27 16:31:46,451 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 2 times [2021-08-27 16:31:46,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980738951] [2021-08-27 16:31:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980738951] [2021-08-27 16:31:46,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980738951] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:46,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804415017] [2021-08-27 16:31:46,472 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:46,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,473 INFO L87 Difference]: Start difference. First operand 1029 states and 1741 transitions. cyclomatic complexity: 724 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,545 INFO L93 Difference]: Finished difference Result 1300 states and 2165 transitions. [2021-08-27 16:31:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:31:46,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 2165 transitions. [2021-08-27 16:31:46,552 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2021-08-27 16:31:46,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 1300 states and 2165 transitions. [2021-08-27 16:31:46,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 892 [2021-08-27 16:31:46,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 892 [2021-08-27 16:31:46,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1300 states and 2165 transitions. [2021-08-27 16:31:46,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,559 INFO L681 BuchiCegarLoop]: Abstraction has 1300 states and 2165 transitions. [2021-08-27 16:31:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states and 2165 transitions. [2021-08-27 16:31:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1276. [2021-08-27 16:31:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1276 states have (on average 1.6778996865203761) internal successors, (2141), 1275 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2141 transitions. [2021-08-27 16:31:46,576 INFO L704 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2021-08-27 16:31:46,576 INFO L587 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2021-08-27 16:31:46,576 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 16:31:46,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1276 states and 2141 transitions. [2021-08-27 16:31:46,580 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2021-08-27 16:31:46,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,581 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] [2021-08-27 16:31:46,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,581 INFO L791 eck$LassoCheckResult]: Stem: 7200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7060#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 7061#L396 assume !(1 == ~c_req_up~0); 6965#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7177#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7178#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7220#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7218#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7217#L427-1 assume !(0 == ~e_f~0); 7216#L432-1 assume !(0 == ~e_g~0); 7025#L437-1 assume !(0 == ~e_e~0); 7026#L442-1 assume !(0 == ~e_c~0); 7059#L447-1 assume !(0 == ~e_wl~0); 7183#L452-1 assume !(1 == ~wl_pc~0); 7186#L464 assume !(2 == ~wl_pc~0); 7185#L465 assume !(1 == ~c1_pc~0); 7067#L475 assume !(1 == ~c2_pc~0); 7135#L484 assume !(1 == ~wb_pc~0); 6962#L493 assume !(1 == ~e_c~0); 6963#L502-1 assume !(1 == ~e_e~0); 6989#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6990#L512-1 assume !(1 == ~e_g~0); 6996#L517-1 assume !(1 == ~e_c~0); 6997#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7498#L664-1 [2021-08-27 16:31:46,581 INFO L793 eck$LassoCheckResult]: Loop: 7498#L664-1 assume !false; 7905#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7610#L369 assume !false; 7900#L287 assume !(0 == ~wl_st~0); 7901#L291 assume !(0 == ~c1_st~0); 7903#L294 assume !(0 == ~c2_st~0); 7898#L297 assume !(0 == ~wb_st~0); 7899#L300 assume !(0 == ~r_st~0); 7902#L385 start_simulation_~kernel_st~0 := 2; 7934#L540 assume !(1 == ~c_req_up~0); 7932#L540-2 start_simulation_~kernel_st~0 := 3; 7931#L552 assume !(0 == ~e_f~0); 7930#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7929#L557-1 assume !(0 == ~e_e~0); 7928#L562-1 assume !(0 == ~e_c~0); 7927#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7926#L572-1 assume !(1 == ~wl_pc~0); 7923#L584 assume !(2 == ~wl_pc~0); 7922#L585 assume !(1 == ~c1_pc~0); 7920#L595 assume !(1 == ~c2_pc~0); 7918#L604 assume !(1 == ~wb_pc~0); 7916#L613 assume !(1 == ~e_c~0); 7915#L622-1 assume !(1 == ~e_e~0); 7914#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7775#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7913#L637-1 assume !(1 == ~e_c~0); 7911#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7910#L647-1 assume 0 == ~wl_st~0; 7498#L664-1 [2021-08-27 16:31:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2021-08-27 16:31:46,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711501449] [2021-08-27 16:31:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711501449] [2021-08-27 16:31:46,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711501449] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:46,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124393840] [2021-08-27 16:31:46,603 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2059595392, now seen corresponding path program 1 times [2021-08-27 16:31:46,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737145742] [2021-08-27 16:31:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737145742] [2021-08-27 16:31:46,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737145742] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:46,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517300610] [2021-08-27 16:31:46,615 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:46,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,616 INFO L87 Difference]: Start difference. First operand 1276 states and 2141 transitions. cyclomatic complexity: 880 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,686 INFO L93 Difference]: Finished difference Result 1415 states and 2300 transitions. [2021-08-27 16:31:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:31:46,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 2300 transitions. [2021-08-27 16:31:46,694 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 891 [2021-08-27 16:31:46,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1415 states and 2300 transitions. [2021-08-27 16:31:46,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 967 [2021-08-27 16:31:46,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2021-08-27 16:31:46,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1415 states and 2300 transitions. [2021-08-27 16:31:46,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,701 INFO L681 BuchiCegarLoop]: Abstraction has 1415 states and 2300 transitions. [2021-08-27 16:31:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states and 2300 transitions. [2021-08-27 16:31:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1385. [2021-08-27 16:31:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1385 states have (on average 1.6389891696750902) internal successors, (2270), 1384 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2270 transitions. [2021-08-27 16:31:46,730 INFO L704 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2021-08-27 16:31:46,730 INFO L587 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2021-08-27 16:31:46,730 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 16:31:46,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 2270 transitions. [2021-08-27 16:31:46,735 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 887 [2021-08-27 16:31:46,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,735 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] [2021-08-27 16:31:46,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,736 INFO L791 eck$LassoCheckResult]: Stem: 9901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9760#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9761#L396 assume !(1 == ~c_req_up~0); 9724#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9725#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9868#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9869#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9896#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9920#L427-1 assume !(0 == ~e_f~0); 9919#L432-1 assume !(0 == ~e_g~0); 9726#L437-1 assume !(0 == ~e_e~0); 9727#L442-1 assume !(0 == ~e_c~0); 9759#L447-1 assume !(0 == ~e_wl~0); 9884#L452-1 assume !(1 == ~wl_pc~0); 9927#L464 assume !(2 == ~wl_pc~0); 9906#L465 assume !(1 == ~c1_pc~0); 9767#L475 assume !(1 == ~c2_pc~0); 9838#L484 assume !(1 == ~wb_pc~0); 9666#L493 assume !(1 == ~e_c~0); 9667#L502-1 assume !(1 == ~e_e~0); 9689#L507-1 assume !(1 == ~e_f~0); 9690#L512-1 assume !(1 == ~e_g~0); 9698#L517-1 assume !(1 == ~e_c~0); 9699#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10165#L664-1 [2021-08-27 16:31:46,736 INFO L793 eck$LassoCheckResult]: Loop: 10165#L664-1 assume !false; 10447#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 9804#L369 assume !false; 9822#L287 assume !(0 == ~wl_st~0); 9823#L291 assume !(0 == ~c1_st~0); 9844#L294 assume !(0 == ~c2_st~0); 9728#L297 assume !(0 == ~wb_st~0); 9730#L300 assume !(0 == ~r_st~0); 9662#L385 start_simulation_~kernel_st~0 := 2; 9663#L540 assume !(1 == ~c_req_up~0); 9680#L540-2 start_simulation_~kernel_st~0 := 3; 9762#L552 assume !(0 == ~e_f~0); 9763#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9810#L557-1 assume !(0 == ~e_e~0); 9853#L562-1 assume !(0 == ~e_c~0); 9863#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9849#L572-1 assume !(1 == ~wl_pc~0); 9776#L584 assume !(2 == ~wl_pc~0); 9777#L585 assume !(1 == ~c1_pc~0); 9769#L595 assume !(1 == ~c2_pc~0); 9781#L604 assume !(1 == ~wb_pc~0); 9754#L613 assume !(1 == ~e_c~0); 9739#L622-1 assume !(1 == ~e_e~0); 9740#L627-1 assume !(1 == ~e_f~0); 9694#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9695#L637-1 assume !(1 == ~e_c~0); 9826#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9870#L647-1 assume 0 == ~wl_st~0; 10165#L664-1 [2021-08-27 16:31:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2021-08-27 16:31:46,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423949867] [2021-08-27 16:31:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423949867] [2021-08-27 16:31:46,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423949867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:46,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429535982] [2021-08-27 16:31:46,754 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2057748350, now seen corresponding path program 1 times [2021-08-27 16:31:46,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941425123] [2021-08-27 16:31:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941425123] [2021-08-27 16:31:46,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941425123] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:46,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686165534] [2021-08-27 16:31:46,767 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:46,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,767 INFO L87 Difference]: Start difference. First operand 1385 states and 2270 transitions. cyclomatic complexity: 900 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:46,837 INFO L93 Difference]: Finished difference Result 2476 states and 3984 transitions. [2021-08-27 16:31:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:31:46,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2476 states and 3984 transitions. [2021-08-27 16:31:46,849 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1451 [2021-08-27 16:31:46,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2476 states to 2476 states and 3984 transitions. [2021-08-27 16:31:46,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1568 [2021-08-27 16:31:46,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1568 [2021-08-27 16:31:46,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2476 states and 3984 transitions. [2021-08-27 16:31:46,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:46,861 INFO L681 BuchiCegarLoop]: Abstraction has 2476 states and 3984 transitions. [2021-08-27 16:31:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states and 3984 transitions. [2021-08-27 16:31:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2468. [2021-08-27 16:31:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2468 states have (on average 1.6110210696920584) internal successors, (3976), 2467 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3976 transitions. [2021-08-27 16:31:46,898 INFO L704 BuchiCegarLoop]: Abstraction has 2468 states and 3976 transitions. [2021-08-27 16:31:46,898 INFO L587 BuchiCegarLoop]: Abstraction has 2468 states and 3976 transitions. [2021-08-27 16:31:46,898 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 16:31:46,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2468 states and 3976 transitions. [2021-08-27 16:31:46,906 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1451 [2021-08-27 16:31:46,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:46,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:46,907 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] [2021-08-27 16:31:46,907 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:46,907 INFO L791 eck$LassoCheckResult]: Stem: 13775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13629#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 13630#L396 assume !(1 == ~c_req_up~0); 13594#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 13595#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 13740#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13741#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13680#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 13681#L427-1 assume !(0 == ~e_f~0); 13790#L432-1 assume !(0 == ~e_g~0); 13596#L437-1 assume !(0 == ~e_e~0); 13597#L442-1 assume !(0 == ~e_c~0); 13628#L447-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 13604#L452-1 assume !(1 == ~wl_pc~0); 13605#L464 assume !(2 == ~wl_pc~0); 13811#L465 assume !(1 == ~c1_pc~0); 13704#L475 assume !(1 == ~c2_pc~0); 13706#L484 assume !(1 == ~wb_pc~0); 13538#L493 assume !(1 == ~e_c~0); 13539#L502-1 assume !(1 == ~e_e~0); 13560#L507-1 assume !(1 == ~e_f~0); 13561#L512-1 assume !(1 == ~e_g~0); 13568#L517-1 assume !(1 == ~e_c~0); 13569#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 14999#L664-1 [2021-08-27 16:31:46,907 INFO L793 eck$LassoCheckResult]: Loop: 14999#L664-1 assume !false; 14998#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 14936#L369 assume !false; 14994#L287 assume !(0 == ~wl_st~0); 14995#L291 assume !(0 == ~c1_st~0); 14997#L294 assume !(0 == ~c2_st~0); 14992#L297 assume !(0 == ~wb_st~0); 14993#L300 assume !(0 == ~r_st~0); 14996#L385 start_simulation_~kernel_st~0 := 2; 15049#L540 assume !(1 == ~c_req_up~0); 15047#L540-2 start_simulation_~kernel_st~0 := 3; 15045#L552 assume !(0 == ~e_f~0); 15043#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 15040#L557-1 assume !(0 == ~e_e~0); 15039#L562-1 assume !(0 == ~e_c~0); 15037#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 15036#L572-1 assume !(1 == ~wl_pc~0); 15032#L584 assume !(2 == ~wl_pc~0); 15029#L585 assume !(1 == ~c1_pc~0); 15027#L595 assume !(1 == ~c2_pc~0); 15021#L604 assume !(1 == ~wb_pc~0); 15017#L613 assume !(1 == ~e_c~0); 15014#L622-1 assume !(1 == ~e_e~0); 15012#L627-1 assume !(1 == ~e_f~0); 15010#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 15008#L637-1 assume !(1 == ~e_c~0); 15006#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 15005#L647-1 assume 0 == ~wl_st~0; 14999#L664-1 [2021-08-27 16:31:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2021-08-27 16:31:46,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012967088] [2021-08-27 16:31:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012967088] [2021-08-27 16:31:46,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012967088] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:31:46,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818678322] [2021-08-27 16:31:46,949 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2057748350, now seen corresponding path program 2 times [2021-08-27 16:31:46,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:46,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334693109] [2021-08-27 16:31:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:46,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:46,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:46,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334693109] [2021-08-27 16:31:46,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334693109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:46,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:46,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:31:46,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808314518] [2021-08-27 16:31:46,963 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:46,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:31:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:31:46,963 INFO L87 Difference]: Start difference. First operand 2468 states and 3976 transitions. cyclomatic complexity: 1531 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,031 INFO L93 Difference]: Finished difference Result 3337 states and 5340 transitions. [2021-08-27 16:31:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:31:47,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3337 states and 5340 transitions. [2021-08-27 16:31:47,044 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1869 [2021-08-27 16:31:47,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3337 states to 3337 states and 5340 transitions. [2021-08-27 16:31:47,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1969 [2021-08-27 16:31:47,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1969 [2021-08-27 16:31:47,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3337 states and 5340 transitions. [2021-08-27 16:31:47,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:47,059 INFO L681 BuchiCegarLoop]: Abstraction has 3337 states and 5340 transitions. [2021-08-27 16:31:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states and 5340 transitions. [2021-08-27 16:31:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3269. [2021-08-27 16:31:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 3269 states have (on average 1.6072193331293974) internal successors, (5254), 3268 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 5254 transitions. [2021-08-27 16:31:47,101 INFO L704 BuchiCegarLoop]: Abstraction has 3269 states and 5254 transitions. [2021-08-27 16:31:47,101 INFO L587 BuchiCegarLoop]: Abstraction has 3269 states and 5254 transitions. [2021-08-27 16:31:47,101 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 16:31:47,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3269 states and 5254 transitions. [2021-08-27 16:31:47,108 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1862 [2021-08-27 16:31:47,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:47,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:47,109 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] [2021-08-27 16:31:47,109 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:47,109 INFO L791 eck$LassoCheckResult]: Stem: 19598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 19443#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 19444#L396 assume !(1 == ~c_req_up~0); 19356#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19570#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19571#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19596#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19597#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19609#L427-1 assume !(0 == ~e_f~0); 19608#L432-1 assume !(0 == ~e_g~0); 19410#L437-1 assume !(0 == ~e_e~0); 19411#L442-1 assume !(0 == ~e_c~0); 19442#L447-1 assume !(0 == ~e_wl~0); 19580#L452-1 assume !(1 == ~wl_pc~0); 19617#L464 assume !(2 == ~wl_pc~0); 19616#L465 assume !(1 == ~c1_pc~0); 19614#L475 assume !(1 == ~c2_pc~0); 19612#L484 assume !(1 == ~wb_pc~0); 19353#L493 assume !(1 == ~e_c~0); 19354#L502-1 assume !(1 == ~e_e~0); 19377#L507-1 assume !(1 == ~e_f~0); 19378#L512-1 assume !(1 == ~e_g~0); 19383#L517-1 assume !(1 == ~e_c~0); 19357#L522-1 assume !(1 == ~e_wl~0); 19358#L664-1 assume !false; 20178#L534 [2021-08-27 16:31:47,109 INFO L793 eck$LassoCheckResult]: Loop: 20178#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 21541#L369 assume !false; 21631#L287 assume !(0 == ~wl_st~0); 21632#L291 assume !(0 == ~c1_st~0); 21634#L294 assume !(0 == ~c2_st~0); 21629#L297 assume !(0 == ~wb_st~0); 21630#L300 assume !(0 == ~r_st~0); 21633#L385 start_simulation_~kernel_st~0 := 2; 21692#L540 assume !(1 == ~c_req_up~0); 21686#L540-2 start_simulation_~kernel_st~0 := 3; 21685#L552 assume !(0 == ~e_f~0); 21684#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 21683#L557-1 assume !(0 == ~e_e~0); 21682#L562-1 assume !(0 == ~e_c~0); 21681#L567-1 assume !(0 == ~e_wl~0); 21680#L572-1 assume !(1 == ~wl_pc~0); 21677#L584 assume !(2 == ~wl_pc~0); 21676#L585 assume !(1 == ~c1_pc~0); 21674#L595 assume !(1 == ~c2_pc~0); 21667#L604 assume !(1 == ~wb_pc~0); 21663#L613 assume !(1 == ~e_c~0); 21656#L622-1 assume !(1 == ~e_e~0); 21653#L627-1 assume !(1 == ~e_f~0); 21652#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 21651#L637-1 assume !(1 == ~e_c~0); 21648#L642-1 assume !(1 == ~e_wl~0); 21646#L647-1 assume 0 == ~wl_st~0; 21641#L664-1 assume !false; 20178#L534 [2021-08-27 16:31:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2021-08-27 16:31:47,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858522036] [2021-08-27 16:31:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,116 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 793828832, now seen corresponding path program 1 times [2021-08-27 16:31:47,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006547487] [2021-08-27 16:31:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:47,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:47,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006547487] [2021-08-27 16:31:47,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006547487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:47,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:47,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:47,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451375449] [2021-08-27 16:31:47,135 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:31:47,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:47,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:47,136 INFO L87 Difference]: Start difference. First operand 3269 states and 5254 transitions. cyclomatic complexity: 2011 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,175 INFO L93 Difference]: Finished difference Result 4142 states and 6587 transitions. [2021-08-27 16:31:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:47,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4142 states and 6587 transitions. [2021-08-27 16:31:47,188 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 2320 [2021-08-27 16:31:47,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4142 states to 4142 states and 6587 transitions. [2021-08-27 16:31:47,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2452 [2021-08-27 16:31:47,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2452 [2021-08-27 16:31:47,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4142 states and 6587 transitions. [2021-08-27 16:31:47,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:47,206 INFO L681 BuchiCegarLoop]: Abstraction has 4142 states and 6587 transitions. [2021-08-27 16:31:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states and 6587 transitions. [2021-08-27 16:31:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 3496. [2021-08-27 16:31:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3496 states have (on average 1.6024027459954233) internal successors, (5602), 3495 states have internal predecessors, (5602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5602 transitions. [2021-08-27 16:31:47,252 INFO L704 BuchiCegarLoop]: Abstraction has 3496 states and 5602 transitions. [2021-08-27 16:31:47,252 INFO L587 BuchiCegarLoop]: Abstraction has 3496 states and 5602 transitions. [2021-08-27 16:31:47,252 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 16:31:47,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3496 states and 5602 transitions. [2021-08-27 16:31:47,259 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 2011 [2021-08-27 16:31:47,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:47,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:47,260 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] [2021-08-27 16:31:47,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:47,260 INFO L791 eck$LassoCheckResult]: Stem: 27017#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 26862#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 26863#L396 assume !(1 == ~c_req_up~0); 26773#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 26988#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 26989#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 27015#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 27016#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 27033#L427-1 assume !(0 == ~e_f~0); 27032#L432-1 assume !(0 == ~e_g~0); 26829#L437-1 assume !(0 == ~e_e~0); 26830#L442-1 assume !(0 == ~e_c~0); 26861#L447-1 assume !(0 == ~e_wl~0); 26994#L452-1 assume !(1 == ~wl_pc~0); 27040#L464 assume !(2 == ~wl_pc~0); 27039#L465 assume !(1 == ~c1_pc~0); 27037#L475 assume !(1 == ~c2_pc~0); 27035#L484 assume !(1 == ~wb_pc~0); 26770#L493 assume !(1 == ~e_c~0); 26771#L502-1 assume !(1 == ~e_e~0); 26795#L507-1 assume !(1 == ~e_f~0); 26796#L512-1 assume !(1 == ~e_g~0); 26801#L517-1 assume !(1 == ~e_c~0); 26802#L522-1 assume !(1 == ~e_wl~0); 27061#L664-1 assume !false; 27062#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 28948#L369 [2021-08-27 16:31:47,260 INFO L793 eck$LassoCheckResult]: Loop: 28948#L369 assume !false; 28935#L287 assume 0 == ~wl_st~0; 28927#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 28929#L313 assume !(0 != eval_~tmp~0); 29071#L309 assume !(0 == ~c1_st~0); 29072#L324 assume !(0 == ~c2_st~0); 29621#L339 assume !(0 == ~wb_st~0); 28950#L354 assume !(0 == ~r_st~0); 28948#L369 [2021-08-27 16:31:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,260 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2021-08-27 16:31:47,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305289771] [2021-08-27 16:31:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,266 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,273 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1276011885, now seen corresponding path program 1 times [2021-08-27 16:31:47,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829587421] [2021-08-27 16:31:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,276 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 357057381, now seen corresponding path program 1 times [2021-08-27 16:31:47,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326032931] [2021-08-27 16:31:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:47,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:47,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326032931] [2021-08-27 16:31:47,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326032931] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:47,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:47,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:47,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931517286] [2021-08-27 16:31:47,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:47,337 INFO L87 Difference]: Start difference. First operand 3496 states and 5602 transitions. cyclomatic complexity: 2133 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,369 INFO L93 Difference]: Finished difference Result 5385 states and 8596 transitions. [2021-08-27 16:31:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:47,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5385 states and 8596 transitions. [2021-08-27 16:31:47,388 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3116 [2021-08-27 16:31:47,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5385 states to 5385 states and 8596 transitions. [2021-08-27 16:31:47,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3254 [2021-08-27 16:31:47,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3254 [2021-08-27 16:31:47,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5385 states and 8596 transitions. [2021-08-27 16:31:47,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:47,410 INFO L681 BuchiCegarLoop]: Abstraction has 5385 states and 8596 transitions. [2021-08-27 16:31:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5385 states and 8596 transitions. [2021-08-27 16:31:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5385 to 5385. [2021-08-27 16:31:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 5385 states have (on average 1.5962859795728876) internal successors, (8596), 5384 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8596 transitions. [2021-08-27 16:31:47,475 INFO L704 BuchiCegarLoop]: Abstraction has 5385 states and 8596 transitions. [2021-08-27 16:31:47,476 INFO L587 BuchiCegarLoop]: Abstraction has 5385 states and 8596 transitions. [2021-08-27 16:31:47,476 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 16:31:47,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5385 states and 8596 transitions. [2021-08-27 16:31:47,487 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3116 [2021-08-27 16:31:47,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:47,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:47,487 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] [2021-08-27 16:31:47,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:47,488 INFO L791 eck$LassoCheckResult]: Stem: 35915#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 35757#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 35758#L396 assume !(1 == ~c_req_up~0); 35662#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 35886#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 35887#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 35913#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 35914#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 35927#L427-1 assume !(0 == ~e_f~0); 35926#L432-1 assume !(0 == ~e_g~0); 35717#L437-1 assume !(0 == ~e_e~0); 35718#L442-1 assume !(0 == ~e_c~0); 35756#L447-1 assume !(0 == ~e_wl~0); 35892#L452-1 assume !(1 == ~wl_pc~0); 35935#L464 assume !(2 == ~wl_pc~0); 35934#L465 assume !(1 == ~c1_pc~0); 35932#L475 assume !(1 == ~c2_pc~0); 35930#L484 assume !(1 == ~wb_pc~0); 35659#L493 assume !(1 == ~e_c~0); 35660#L502-1 assume !(1 == ~e_e~0); 35684#L507-1 assume !(1 == ~e_f~0); 35685#L512-1 assume !(1 == ~e_g~0); 35690#L517-1 assume !(1 == ~e_c~0); 35663#L522-1 assume !(1 == ~e_wl~0); 35664#L664-1 assume !false; 37573#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 39854#L369 [2021-08-27 16:31:47,488 INFO L793 eck$LassoCheckResult]: Loop: 39854#L369 assume !false; 39856#L287 assume 0 == ~wl_st~0; 39477#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 39083#L313 assume !(0 != eval_~tmp~0); 39084#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 39874#L328 assume !(0 != eval_~tmp___0~0); 39867#L324 assume !(0 == ~c2_st~0); 39859#L339 assume !(0 == ~wb_st~0); 39855#L354 assume !(0 == ~r_st~0); 39854#L369 [2021-08-27 16:31:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2021-08-27 16:31:47,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016756661] [2021-08-27 16:31:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,507 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,520 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 1 times [2021-08-27 16:31:47,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951796937] [2021-08-27 16:31:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,524 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1866895320, now seen corresponding path program 1 times [2021-08-27 16:31:47,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110217544] [2021-08-27 16:31:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:47,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:47,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110217544] [2021-08-27 16:31:47,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110217544] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:47,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:47,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:47,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090199545] [2021-08-27 16:31:47,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:47,588 INFO L87 Difference]: Start difference. First operand 5385 states and 8596 transitions. cyclomatic complexity: 3238 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,627 INFO L93 Difference]: Finished difference Result 8560 states and 13539 transitions. [2021-08-27 16:31:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:47,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8560 states and 13539 transitions. [2021-08-27 16:31:47,657 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4933 [2021-08-27 16:31:47,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8560 states to 8560 states and 13539 transitions. [2021-08-27 16:31:47,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5155 [2021-08-27 16:31:47,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5155 [2021-08-27 16:31:47,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8560 states and 13539 transitions. [2021-08-27 16:31:47,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:47,700 INFO L681 BuchiCegarLoop]: Abstraction has 8560 states and 13539 transitions. [2021-08-27 16:31:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states and 13539 transitions. [2021-08-27 16:31:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 8560. [2021-08-27 16:31:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8560 states, 8560 states have (on average 1.5816588785046728) internal successors, (13539), 8559 states have internal predecessors, (13539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 13539 transitions. [2021-08-27 16:31:47,851 INFO L704 BuchiCegarLoop]: Abstraction has 8560 states and 13539 transitions. [2021-08-27 16:31:47,851 INFO L587 BuchiCegarLoop]: Abstraction has 8560 states and 13539 transitions. [2021-08-27 16:31:47,851 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 16:31:47,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8560 states and 13539 transitions. [2021-08-27 16:31:47,869 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4933 [2021-08-27 16:31:47,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:47,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:47,869 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] [2021-08-27 16:31:47,869 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:47,870 INFO L791 eck$LassoCheckResult]: Stem: 49883#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 49705#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 49706#L396 assume !(1 == ~c_req_up~0); 49615#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 49853#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 49854#L412-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 49881#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 49882#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 49910#L427-1 assume !(0 == ~e_f~0); 49909#L432-1 assume !(0 == ~e_g~0); 49666#L437-1 assume !(0 == ~e_e~0); 49667#L442-1 assume !(0 == ~e_c~0); 49704#L447-1 assume !(0 == ~e_wl~0); 49861#L452-1 assume !(1 == ~wl_pc~0); 49862#L464 assume !(2 == ~wl_pc~0); 49863#L465 assume !(1 == ~c1_pc~0); 49713#L475 assume !(1 == ~c2_pc~0); 49798#L484 assume !(1 == ~wb_pc~0); 49612#L493 assume !(1 == ~e_c~0); 49613#L502-1 assume !(1 == ~e_e~0); 49635#L507-1 assume !(1 == ~e_f~0); 49636#L512-1 assume !(1 == ~e_g~0); 49930#L517-1 assume !(1 == ~e_c~0); 52348#L522-1 assume !(1 == ~e_wl~0); 52346#L664-1 assume !false; 52347#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 54027#L369 [2021-08-27 16:31:47,870 INFO L793 eck$LassoCheckResult]: Loop: 54027#L369 assume !false; 54022#L287 assume 0 == ~wl_st~0; 54018#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 54015#L313 assume !(0 != eval_~tmp~0); 54016#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 54043#L328 assume !(0 != eval_~tmp___0~0); 54040#L324 assume !(0 == ~c2_st~0); 54031#L339 assume !(0 == ~wb_st~0); 54030#L354 assume !(0 == ~r_st~0); 54027#L369 [2021-08-27 16:31:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2021-08-27 16:31:47,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650267665] [2021-08-27 16:31:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:47,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:47,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650267665] [2021-08-27 16:31:47,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650267665] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:47,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:47,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:47,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49636166] [2021-08-27 16:31:47,910 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:31:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 2 times [2021-08-27 16:31:47,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:47,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321180102] [2021-08-27 16:31:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:47,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,913 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:47,915 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:47,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:47,965 INFO L87 Difference]: Start difference. First operand 8560 states and 13539 transitions. cyclomatic complexity: 5006 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:47,992 INFO L93 Difference]: Finished difference Result 8508 states and 13462 transitions. [2021-08-27 16:31:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:47,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8508 states and 13462 transitions. [2021-08-27 16:31:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4933 [2021-08-27 16:31:48,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8508 states to 8508 states and 13462 transitions. [2021-08-27 16:31:48,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5105 [2021-08-27 16:31:48,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5105 [2021-08-27 16:31:48,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8508 states and 13462 transitions. [2021-08-27 16:31:48,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:48,078 INFO L681 BuchiCegarLoop]: Abstraction has 8508 states and 13462 transitions. [2021-08-27 16:31:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states and 13462 transitions. [2021-08-27 16:31:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8508. [2021-08-27 16:31:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8508 states, 8508 states have (on average 1.5822755054066762) internal successors, (13462), 8507 states have internal predecessors, (13462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 13462 transitions. [2021-08-27 16:31:48,188 INFO L704 BuchiCegarLoop]: Abstraction has 8508 states and 13462 transitions. [2021-08-27 16:31:48,188 INFO L587 BuchiCegarLoop]: Abstraction has 8508 states and 13462 transitions. [2021-08-27 16:31:48,188 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 16:31:48,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8508 states and 13462 transitions. [2021-08-27 16:31:48,209 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4933 [2021-08-27 16:31:48,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:48,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:48,209 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] [2021-08-27 16:31:48,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:48,210 INFO L791 eck$LassoCheckResult]: Stem: 66954#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 66782#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 66783#L396 assume !(1 == ~c_req_up~0); 66689#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 66921#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 66922#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 66952#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 66953#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 66969#L427-1 assume !(0 == ~e_f~0); 66968#L432-1 assume !(0 == ~e_g~0); 66741#L437-1 assume !(0 == ~e_e~0); 66742#L442-1 assume !(0 == ~e_c~0); 66781#L447-1 assume !(0 == ~e_wl~0); 66927#L452-1 assume !(1 == ~wl_pc~0); 66977#L464 assume !(2 == ~wl_pc~0); 66976#L465 assume !(1 == ~c1_pc~0); 66974#L475 assume !(1 == ~c2_pc~0); 66972#L484 assume !(1 == ~wb_pc~0); 66686#L493 assume !(1 == ~e_c~0); 66687#L502-1 assume !(1 == ~e_e~0); 66710#L507-1 assume !(1 == ~e_f~0); 66711#L512-1 assume !(1 == ~e_g~0); 66716#L517-1 assume !(1 == ~e_c~0); 66690#L522-1 assume !(1 == ~e_wl~0); 66691#L664-1 assume !false; 69332#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 70747#L369 [2021-08-27 16:31:48,210 INFO L793 eck$LassoCheckResult]: Loop: 70747#L369 assume !false; 73447#L287 assume 0 == ~wl_st~0; 73445#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 73442#L313 assume !(0 != eval_~tmp~0); 73436#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 73434#L328 assume !(0 != eval_~tmp___0~0); 73433#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 73424#L343 assume !(0 != eval_~tmp___1~0); 70750#L339 assume !(0 == ~wb_st~0); 70749#L354 assume !(0 == ~r_st~0); 70747#L369 [2021-08-27 16:31:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2021-08-27 16:31:48,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393706724] [2021-08-27 16:31:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,216 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 606182616, now seen corresponding path program 1 times [2021-08-27 16:31:48,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759603072] [2021-08-27 16:31:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,225 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2040800048, now seen corresponding path program 1 times [2021-08-27 16:31:48,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019891985] [2021-08-27 16:31:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:31:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:31:48,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:31:48,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019891985] [2021-08-27 16:31:48,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019891985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:31:48,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:31:48,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:31:48,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567033979] [2021-08-27 16:31:48,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:31:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:31:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:31:48,327 INFO L87 Difference]: Start difference. First operand 8508 states and 13462 transitions. cyclomatic complexity: 4981 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:31:48,389 INFO L93 Difference]: Finished difference Result 14674 states and 23053 transitions. [2021-08-27 16:31:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:31:48,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14674 states and 23053 transitions. [2021-08-27 16:31:48,445 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 8506 [2021-08-27 16:31:48,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14674 states to 14674 states and 23053 transitions. [2021-08-27 16:31:48,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8764 [2021-08-27 16:31:48,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8764 [2021-08-27 16:31:48,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14674 states and 23053 transitions. [2021-08-27 16:31:48,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:31:48,498 INFO L681 BuchiCegarLoop]: Abstraction has 14674 states and 23053 transitions. [2021-08-27 16:31:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14674 states and 23053 transitions. [2021-08-27 16:31:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14674 to 14674. [2021-08-27 16:31:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14674 states, 14674 states have (on average 1.5710099495706693) internal successors, (23053), 14673 states have internal predecessors, (23053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:31:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14674 states to 14674 states and 23053 transitions. [2021-08-27 16:31:48,787 INFO L704 BuchiCegarLoop]: Abstraction has 14674 states and 23053 transitions. [2021-08-27 16:31:48,787 INFO L587 BuchiCegarLoop]: Abstraction has 14674 states and 23053 transitions. [2021-08-27 16:31:48,787 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 16:31:48,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14674 states and 23053 transitions. [2021-08-27 16:31:48,817 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 8506 [2021-08-27 16:31:48,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:31:48,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:31:48,818 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] [2021-08-27 16:31:48,818 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:31:48,819 INFO L791 eck$LassoCheckResult]: Stem: 90150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 89973#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 89974#L396 assume !(1 == ~c_req_up~0); 89879#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 90112#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 90113#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 90147#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 90148#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 90174#L427-1 assume !(0 == ~e_f~0); 90173#L432-1 assume !(0 == ~e_g~0); 89931#L437-1 assume !(0 == ~e_e~0); 89932#L442-1 assume !(0 == ~e_c~0); 89972#L447-1 assume !(0 == ~e_wl~0); 90122#L452-1 assume !(1 == ~wl_pc~0); 90182#L464 assume !(2 == ~wl_pc~0); 90181#L465 assume !(1 == ~c1_pc~0); 90179#L475 assume !(1 == ~c2_pc~0); 90177#L484 assume !(1 == ~wb_pc~0); 89876#L493 assume !(1 == ~e_c~0); 89877#L502-1 assume !(1 == ~e_e~0); 89896#L507-1 assume !(1 == ~e_f~0); 89897#L512-1 assume !(1 == ~e_g~0); 89906#L517-1 assume !(1 == ~e_c~0); 89880#L522-1 assume !(1 == ~e_wl~0); 89881#L664-1 assume !false; 92265#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 99428#L369 [2021-08-27 16:31:48,819 INFO L793 eck$LassoCheckResult]: Loop: 99428#L369 assume !false; 99681#L287 assume 0 == ~wl_st~0; 99678#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 99674#L313 assume !(0 != eval_~tmp~0); 99672#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 99543#L328 assume !(0 != eval_~tmp___0~0); 99671#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 99630#L343 assume !(0 != eval_~tmp___1~0); 99667#L339 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 99314#L358 assume !(0 != eval_~tmp___2~0); 99344#L354 assume !(0 == ~r_st~0); 99428#L369 [2021-08-27 16:31:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2021-08-27 16:31:48,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273946812] [2021-08-27 16:31:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,825 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1611757493, now seen corresponding path program 1 times [2021-08-27 16:31:48,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901715926] [2021-08-27 16:31:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,840 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,842 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:31:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1159673533, now seen corresponding path program 1 times [2021-08-27 16:31:48,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:31:48,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365567311] [2021-08-27 16:31:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:31:48,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:31:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,852 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:31:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:31:48,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:31:50,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:31:50 BoogieIcfgContainer [2021-08-27 16:31:50,056 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:31:50,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:31:50,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:31:50,056 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:31:50,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:31:43" (3/4) ... [2021-08-27 16:31:50,058 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:31:50,085 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:31:50,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:31:50,086 INFO L168 Benchmark]: Toolchain (without parser) took 7446.74 ms. Allocated memory was 71.3 MB in the beginning and 805.3 MB in the end (delta: 734.0 MB). Free memory was 50.7 MB in the beginning and 607.8 MB in the end (delta: -557.1 MB). Peak memory consumption was 175.7 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,087 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 71.3 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:31:50,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.35 ms. Allocated memory is still 71.3 MB. Free memory was 50.5 MB in the beginning and 51.6 MB in the end (delta: -1.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.46 ms. Allocated memory is still 71.3 MB. Free memory was 51.6 MB in the beginning and 49.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,087 INFO L168 Benchmark]: Boogie Preprocessor took 39.25 ms. Allocated memory is still 71.3 MB. Free memory was 49.2 MB in the beginning and 47.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,088 INFO L168 Benchmark]: RCFGBuilder took 623.46 ms. Allocated memory was 71.3 MB in the beginning and 94.4 MB in the end (delta: 23.1 MB). Free memory was 47.2 MB in the beginning and 73.1 MB in the end (delta: -25.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,088 INFO L168 Benchmark]: BuchiAutomizer took 6447.84 ms. Allocated memory was 94.4 MB in the beginning and 805.3 MB in the end (delta: 710.9 MB). Free memory was 72.6 MB in the beginning and 610.8 MB in the end (delta: -538.3 MB). Peak memory consumption was 310.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,088 INFO L168 Benchmark]: Witness Printer took 29.49 ms. Allocated memory is still 805.3 MB. Free memory was 610.8 MB in the beginning and 607.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:31:50,089 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.15 ms. Allocated memory is still 71.3 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 273.35 ms. Allocated memory is still 71.3 MB. Free memory was 50.5 MB in the beginning and 51.6 MB in the end (delta: -1.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.46 ms. Allocated memory is still 71.3 MB. Free memory was 51.6 MB in the beginning and 49.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.25 ms. Allocated memory is still 71.3 MB. Free memory was 49.2 MB in the beginning and 47.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 623.46 ms. Allocated memory was 71.3 MB in the beginning and 94.4 MB in the end (delta: 23.1 MB). Free memory was 47.2 MB in the beginning and 73.1 MB in the end (delta: -25.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6447.84 ms. Allocated memory was 94.4 MB in the beginning and 805.3 MB in the end (delta: 710.9 MB). Free memory was 72.6 MB in the beginning and 610.8 MB in the end (delta: -538.3 MB). Peak memory consumption was 310.1 MB. Max. memory is 16.1 GB. * Witness Printer took 29.49 ms. Allocated memory is still 805.3 MB. Free memory was 610.8 MB in the beginning and 607.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (16 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 14674 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 868.1ms AutomataMinimizationTime, 17 MinimizatonAttempts, 918 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 14674 states and ocurred in iteration 16. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4252 SDtfs, 4141 SDslu, 2308 SDs, 0 SdLazy, 427 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 333.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI9 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 286]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=17603} State at position 1 is {wb_st=0, NULL=0, NULL=17603, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fe8f980=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e821678=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=17606, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=17605, wl_i=1, NULL=0, c1_st=0, NULL=17604, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cd85018=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@352205b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79d51dd8=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 286]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 [L396] COND FALSE !((int )c_req_up == 1) [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 [L432] COND FALSE !((int )e_f == 0) [L437] COND FALSE !((int )e_g == 0) [L442] COND FALSE !((int )e_e == 0) [L447] COND FALSE !((int )e_c == 0) [L452] COND FALSE !((int )e_wl == 0) [L457] COND FALSE !((int )wl_pc == 1) [L465] COND FALSE !((int )wl_pc == 2) [L475] COND FALSE !((int )c1_pc == 1) [L484] COND FALSE !((int )c2_pc == 1) [L493] COND FALSE !((int )wb_pc == 1) [L502] COND FALSE !((int )e_c == 1) [L507] COND FALSE !((int )e_e == 1) [L512] COND FALSE !((int )e_f == 1) [L517] COND FALSE !((int )e_g == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_wl == 1) [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; Loop: [L286] COND TRUE 1 [L288] COND TRUE (int )wl_st == 0 [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND FALSE !(\read(tmp)) [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND FALSE !(\read(tmp___0)) [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND FALSE !(\read(tmp___1)) [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___2)) [L369] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:31:50,121 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...